./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:36:36,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:36:36,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:36:36,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:36:36,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:36:36,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:36:36,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:36:36,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:36:36,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:36:36,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:36:36,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:36:36,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:36:36,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:36:36,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:36:36,562 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:36:36,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:36:36,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:36:36,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:36:36,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:36:36,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:36:36,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:36:36,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:36:36,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:36:36,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:36:36,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:36:36,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:36:36,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:36:36,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:36:36,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:36:36,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:36:36,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:36:36,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:36:36,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:36:36,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:36:36,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:36:36,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:36:36,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:36:36,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:36:36,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:36:36,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:36:36,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:36:36,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:36:36,572 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9 [2024-10-13 01:36:36,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:36:36,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:36:36,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:36:36,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:36:36,872 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:36:36,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-10-13 01:36:38,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:36:38,570 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:36:38,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-10-13 01:36:38,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628c21df2/db132b3cd0a44e6d9805079bb5615a73/FLAG57f4e9d4c [2024-10-13 01:36:38,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628c21df2/db132b3cd0a44e6d9805079bb5615a73 [2024-10-13 01:36:38,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:36:38,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:36:38,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:36:38,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:36:38,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:36:38,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:36:38" (1/1) ... [2024-10-13 01:36:38,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c67c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:38, skipping insertion in model container [2024-10-13 01:36:38,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:36:38" (1/1) ... [2024-10-13 01:36:38,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:36:39,215 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i[919,932] [2024-10-13 01:36:39,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:36:39,326 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:36:39,336 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i[919,932] [2024-10-13 01:36:39,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:36:39,390 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:36:39,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39 WrapperNode [2024-10-13 01:36:39,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:36:39,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:36:39,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:36:39,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:36:39,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,456 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-10-13 01:36:39,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:36:39,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:36:39,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:36:39,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:36:39,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,509 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:36:39,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:36:39,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:36:39,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:36:39,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:36:39,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (1/1) ... [2024-10-13 01:36:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:36:39,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:36:39,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:36:39,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:36:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:36:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:36:39,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:36:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:36:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:36:39,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:36:39,725 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:36:39,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:36:40,217 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 01:36:40,218 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:36:40,262 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:36:40,263 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:36:40,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:36:40 BoogieIcfgContainer [2024-10-13 01:36:40,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:36:40,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:36:40,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:36:40,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:36:40,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:36:38" (1/3) ... [2024-10-13 01:36:40,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469167b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:36:40, skipping insertion in model container [2024-10-13 01:36:40,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:36:39" (2/3) ... [2024-10-13 01:36:40,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469167b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:36:40, skipping insertion in model container [2024-10-13 01:36:40,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:36:40" (3/3) ... [2024-10-13 01:36:40,276 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-10-13 01:36:40,291 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:36:40,291 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:36:40,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:36:40,359 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3dfae649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:36:40,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:36:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 46 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 01:36:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 01:36:40,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:40,383 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:40,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:40,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1856398152, now seen corresponding path program 1 times [2024-10-13 01:36:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774318813] [2024-10-13 01:36:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:36:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:36:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:36:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:36:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:36:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:36:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:36:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:36:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:36:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:36:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:36:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:36:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:36:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:36:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:36:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:36:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:36:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:36:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:36:40,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774318813] [2024-10-13 01:36:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774318813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:36:40,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:36:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:36:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220044791] [2024-10-13 01:36:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:36:40,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:36:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:36:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:36:40,899 INFO L87 Difference]: Start difference. First operand has 66 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 46 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 01:36:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:40,954 INFO L93 Difference]: Finished difference Result 128 states and 228 transitions. [2024-10-13 01:36:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:36:40,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-10-13 01:36:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:40,966 INFO L225 Difference]: With dead ends: 128 [2024-10-13 01:36:40,967 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 01:36:40,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:36:40,977 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:40,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:36:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 01:36:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 01:36:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 01:36:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2024-10-13 01:36:41,033 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 125 [2024-10-13 01:36:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:41,034 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2024-10-13 01:36:41,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 01:36:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2024-10-13 01:36:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 01:36:41,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:41,043 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:41,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:36:41,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:41,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash -969613252, now seen corresponding path program 1 times [2024-10-13 01:36:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195969527] [2024-10-13 01:36:41,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:36:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:36:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:36:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:36:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:36:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:36:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:36:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:36:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:36:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:36:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:36:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:36:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:36:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:36:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:36:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:36:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:36:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:36:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:36:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195969527] [2024-10-13 01:36:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195969527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:36:41,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:36:41,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:36:41,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772075980] [2024-10-13 01:36:41,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:36:41,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:36:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:41,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:36:41,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:36:41,627 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:41,818 INFO L93 Difference]: Finished difference Result 188 states and 296 transitions. [2024-10-13 01:36:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:36:41,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-13 01:36:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:41,826 INFO L225 Difference]: With dead ends: 188 [2024-10-13 01:36:41,829 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 01:36:41,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:36:41,831 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 86 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:41,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 280 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:36:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 01:36:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2024-10-13 01:36:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 01:36:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2024-10-13 01:36:41,878 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 125 [2024-10-13 01:36:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:41,880 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2024-10-13 01:36:41,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2024-10-13 01:36:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:36:41,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:41,886 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:41,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:36:41,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:41,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash 897220106, now seen corresponding path program 1 times [2024-10-13 01:36:41,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893637064] [2024-10-13 01:36:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:36:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:36:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:36:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:36:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:36:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:36:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:36:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:36:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:36:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:36:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:36:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:36:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:36:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:36:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:36:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:36:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:36:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:36:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:36:42,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:42,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893637064] [2024-10-13 01:36:42,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893637064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:36:42,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:36:42,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:36:42,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336949093] [2024-10-13 01:36:42,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:36:42,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:36:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:36:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:36:42,240 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:42,348 INFO L93 Difference]: Finished difference Result 221 states and 346 transitions. [2024-10-13 01:36:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:36:42,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:36:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:42,352 INFO L225 Difference]: With dead ends: 221 [2024-10-13 01:36:42,352 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 01:36:42,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:36:42,354 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 83 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:42,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 221 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:36:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 01:36:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 110. [2024-10-13 01:36:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 01:36:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 172 transitions. [2024-10-13 01:36:42,386 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 172 transitions. Word has length 126 [2024-10-13 01:36:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 172 transitions. [2024-10-13 01:36:42,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 172 transitions. [2024-10-13 01:36:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:36:42,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:42,392 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:42,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:36:42,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 87873480, now seen corresponding path program 1 times [2024-10-13 01:36:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653933126] [2024-10-13 01:36:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:36:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:36:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:36:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:36:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:36:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:36:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:36:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:36:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:36:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:36:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:36:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:36:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:36:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:36:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:36:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:36:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:36:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:36:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:36:42,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653933126] [2024-10-13 01:36:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653933126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:36:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:36:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:36:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495951631] [2024-10-13 01:36:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:36:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:36:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:36:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:36:42,727 INFO L87 Difference]: Start difference. First operand 110 states and 172 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:42,864 INFO L93 Difference]: Finished difference Result 235 states and 366 transitions. [2024-10-13 01:36:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:36:42,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:36:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:42,868 INFO L225 Difference]: With dead ends: 235 [2024-10-13 01:36:42,871 INFO L226 Difference]: Without dead ends: 160 [2024-10-13 01:36:42,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:36:42,873 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 75 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:42,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 145 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:36:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-13 01:36:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-10-13 01:36:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.4649122807017543) internal successors, (167), 115 states have internal predecessors, (167), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 01:36:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2024-10-13 01:36:42,912 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 126 [2024-10-13 01:36:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:42,913 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2024-10-13 01:36:42,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2024-10-13 01:36:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:36:42,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:42,921 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:36:42,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash 86026438, now seen corresponding path program 1 times [2024-10-13 01:36:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318434743] [2024-10-13 01:36:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:36:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:36:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:36:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:36:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:36:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:36:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:36:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:36:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:36:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:36:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:36:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:36:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:36:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:36:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:36:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:36:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:36:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:36:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:36:43,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318434743] [2024-10-13 01:36:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318434743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:36:43,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:36:43,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:36:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868842946] [2024-10-13 01:36:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:36:43,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:36:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:43,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:36:43,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:36:43,307 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:43,691 INFO L93 Difference]: Finished difference Result 504 states and 810 transitions. [2024-10-13 01:36:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:36:43,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:36:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:43,697 INFO L225 Difference]: With dead ends: 504 [2024-10-13 01:36:43,697 INFO L226 Difference]: Without dead ends: 386 [2024-10-13 01:36:43,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:36:43,699 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 149 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:43,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 435 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:36:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-13 01:36:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 230. [2024-10-13 01:36:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 168 states have (on average 1.4821428571428572) internal successors, (249), 169 states have internal predecessors, (249), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 01:36:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 361 transitions. [2024-10-13 01:36:43,734 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 361 transitions. Word has length 126 [2024-10-13 01:36:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:43,735 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 361 transitions. [2024-10-13 01:36:43,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 361 transitions. [2024-10-13 01:36:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:36:43,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:43,738 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:43,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:36:43,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:43,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1719411896, now seen corresponding path program 1 times [2024-10-13 01:36:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:43,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098452949] [2024-10-13 01:36:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:36:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:36:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:36:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:36:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:36:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:36:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:36:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:36:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:36:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:36:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:36:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:36:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:36:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:36:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:36:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:36:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:36:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:36:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:36:43,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:43,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098452949] [2024-10-13 01:36:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098452949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:36:43,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:36:43,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:36:43,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696329658] [2024-10-13 01:36:43,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:36:43,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:36:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:43,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:36:43,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:36:43,923 INFO L87 Difference]: Start difference. First operand 230 states and 361 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:43,979 INFO L93 Difference]: Finished difference Result 421 states and 667 transitions. [2024-10-13 01:36:43,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:36:43,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:36:43,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:43,984 INFO L225 Difference]: With dead ends: 421 [2024-10-13 01:36:43,984 INFO L226 Difference]: Without dead ends: 230 [2024-10-13 01:36:43,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:36:43,987 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:43,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:36:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-13 01:36:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-10-13 01:36:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 168 states have (on average 1.4464285714285714) internal successors, (243), 169 states have internal predecessors, (243), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 01:36:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2024-10-13 01:36:44,021 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 126 [2024-10-13 01:36:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:44,021 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2024-10-13 01:36:44,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2024-10-13 01:36:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:36:44,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:44,023 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:44,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 01:36:44,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:44,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 987207498, now seen corresponding path program 1 times [2024-10-13 01:36:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561751721] [2024-10-13 01:36:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:36:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:36:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:36:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:36:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:36:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:36:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:36:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:36:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:36:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:36:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:36:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:36:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:36:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:36:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:36:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:36:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:36:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:36:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 45 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-10-13 01:36:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561751721] [2024-10-13 01:36:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561751721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:36:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910828755] [2024-10-13 01:36:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:44,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:44,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:36:44,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:36:44,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:36:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:44,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 01:36:44,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:36:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-10-13 01:36:45,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:36:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-10-13 01:36:45,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910828755] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:36:45,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:36:45,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-13 01:36:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555119521] [2024-10-13 01:36:45,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:36:45,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 01:36:45,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:45,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 01:36:45,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:36:45,571 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-13 01:36:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:46,561 INFO L93 Difference]: Finished difference Result 751 states and 1107 transitions. [2024-10-13 01:36:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-13 01:36:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 126 [2024-10-13 01:36:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:46,567 INFO L225 Difference]: With dead ends: 751 [2024-10-13 01:36:46,568 INFO L226 Difference]: Without dead ends: 633 [2024-10-13 01:36:46,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 01:36:46,570 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 256 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:46,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 582 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:36:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-10-13 01:36:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 388. [2024-10-13 01:36:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 296 states have (on average 1.4054054054054055) internal successors, (416), 298 states have internal predecessors, (416), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-13 01:36:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 568 transitions. [2024-10-13 01:36:46,648 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 568 transitions. Word has length 126 [2024-10-13 01:36:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:46,649 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 568 transitions. [2024-10-13 01:36:46,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-13 01:36:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 568 transitions. [2024-10-13 01:36:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:36:46,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:46,651 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:46,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:36:46,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:46,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:46,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1206062216, now seen corresponding path program 1 times [2024-10-13 01:36:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:46,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100253374] [2024-10-13 01:36:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:36:46,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [208271705] [2024-10-13 01:36:46,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:46,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:46,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:36:46,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:36:46,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:36:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:47,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 01:36:47,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:36:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 158 proven. 84 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-13 01:36:47,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:36:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100253374] [2024-10-13 01:36:48,504 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 01:36:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208271705] [2024-10-13 01:36:48,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208271705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:36:48,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:36:48,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-13 01:36:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034136275] [2024-10-13 01:36:48,505 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 01:36:48,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 01:36:48,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 01:36:48,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=272, Unknown=7, NotChecked=0, Total=380 [2024-10-13 01:36:48,507 INFO L87 Difference]: Start difference. First operand 388 states and 568 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 01:36:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:49,314 INFO L93 Difference]: Finished difference Result 1188 states and 1722 transitions. [2024-10-13 01:36:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 01:36:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 126 [2024-10-13 01:36:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:49,320 INFO L225 Difference]: With dead ends: 1188 [2024-10-13 01:36:49,320 INFO L226 Difference]: Without dead ends: 861 [2024-10-13 01:36:49,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=789, Unknown=7, NotChecked=0, Total=1122 [2024-10-13 01:36:49,322 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 271 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:49,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 540 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:36:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-13 01:36:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 771. [2024-10-13 01:36:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 602 states have (on average 1.4053156146179402) internal successors, (846), 606 states have internal predecessors, (846), 134 states have call successors, (134), 34 states have call predecessors, (134), 34 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2024-10-13 01:36:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1114 transitions. [2024-10-13 01:36:49,410 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1114 transitions. Word has length 126 [2024-10-13 01:36:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:49,410 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1114 transitions. [2024-10-13 01:36:49,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 01:36:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1114 transitions. [2024-10-13 01:36:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:36:49,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:49,412 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:49,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 01:36:49,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 01:36:49,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:49,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1628764042, now seen corresponding path program 1 times [2024-10-13 01:36:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837599582] [2024-10-13 01:36:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:49,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:36:49,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763113642] [2024-10-13 01:36:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:49,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:49,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:36:49,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:36:49,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 01:36:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:49,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 01:36:49,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:36:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 01:36:50,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:36:51,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837599582] [2024-10-13 01:36:51,385 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 01:36:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763113642] [2024-10-13 01:36:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763113642] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:36:51,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:36:51,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-13 01:36:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080684626] [2024-10-13 01:36:51,385 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 01:36:51,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 01:36:51,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:51,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 01:36:51,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-13 01:36:51,386 INFO L87 Difference]: Start difference. First operand 771 states and 1114 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 01:36:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:52,353 INFO L93 Difference]: Finished difference Result 1831 states and 2663 transitions. [2024-10-13 01:36:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 01:36:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2024-10-13 01:36:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:52,360 INFO L225 Difference]: With dead ends: 1831 [2024-10-13 01:36:52,360 INFO L226 Difference]: Without dead ends: 1129 [2024-10-13 01:36:52,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-13 01:36:52,364 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 138 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 49 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:52,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 737 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 725 Invalid, 14 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:36:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-10-13 01:36:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 905. [2024-10-13 01:36:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 690 states have (on average 1.3811594202898552) internal successors, (953), 694 states have internal predecessors, (953), 170 states have call successors, (170), 44 states have call predecessors, (170), 44 states have return successors, (170), 166 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-13 01:36:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1293 transitions. [2024-10-13 01:36:52,447 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1293 transitions. Word has length 126 [2024-10-13 01:36:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:52,447 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1293 transitions. [2024-10-13 01:36:52,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 01:36:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1293 transitions. [2024-10-13 01:36:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 01:36:52,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:52,449 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:52,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 01:36:52,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:52,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:52,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1684611475, now seen corresponding path program 1 times [2024-10-13 01:36:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416376606] [2024-10-13 01:36:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:36:52,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628235752] [2024-10-13 01:36:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:52,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:52,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:36:52,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:36:52,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 01:36:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:52,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 01:36:52,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:36:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 01:36:53,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:36:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:36:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416376606] [2024-10-13 01:36:53,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 01:36:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628235752] [2024-10-13 01:36:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628235752] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 01:36:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:36:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-10-13 01:36:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225578650] [2024-10-13 01:36:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:36:53,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:36:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:36:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:36:53,780 INFO L87 Difference]: Start difference. First operand 905 states and 1293 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:54,894 INFO L93 Difference]: Finished difference Result 1634 states and 2311 transitions. [2024-10-13 01:36:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 01:36:54,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-10-13 01:36:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:54,904 INFO L225 Difference]: With dead ends: 1634 [2024-10-13 01:36:54,904 INFO L226 Difference]: Without dead ends: 1385 [2024-10-13 01:36:54,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-13 01:36:54,907 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 392 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:54,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 467 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 01:36:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-10-13 01:36:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 981. [2024-10-13 01:36:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 754 states have (on average 1.396551724137931) internal successors, (1053), 762 states have internal predecessors, (1053), 178 states have call successors, (178), 48 states have call predecessors, (178), 48 states have return successors, (178), 170 states have call predecessors, (178), 178 states have call successors, (178) [2024-10-13 01:36:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1409 transitions. [2024-10-13 01:36:55,031 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1409 transitions. Word has length 127 [2024-10-13 01:36:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:55,031 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1409 transitions. [2024-10-13 01:36:55,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:36:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1409 transitions. [2024-10-13 01:36:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 01:36:55,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:55,033 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:55,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 01:36:55,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:55,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:55,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 875264849, now seen corresponding path program 1 times [2024-10-13 01:36:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:55,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376247977] [2024-10-13 01:36:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:36:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:36:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:36:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:36:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:36:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:36:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:36:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:36:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:36:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:36:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:36:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:36:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:36:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:36:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:36:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:36:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:36:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:36:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 01:36:55,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:36:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376247977] [2024-10-13 01:36:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376247977] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:36:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419303582] [2024-10-13 01:36:55,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:55,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:55,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:36:55,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:36:55,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 01:36:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:36:55,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 01:36:55,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:36:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 01:36:55,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:36:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 01:36:56,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419303582] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:36:56,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:36:56,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-13 01:36:56,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177239643] [2024-10-13 01:36:56,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:36:56,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 01:36:56,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:36:56,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 01:36:56,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-13 01:36:56,239 INFO L87 Difference]: Start difference. First operand 981 states and 1409 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2024-10-13 01:36:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:36:57,289 INFO L93 Difference]: Finished difference Result 2060 states and 2883 transitions. [2024-10-13 01:36:57,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 01:36:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 127 [2024-10-13 01:36:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:36:57,297 INFO L225 Difference]: With dead ends: 2060 [2024-10-13 01:36:57,297 INFO L226 Difference]: Without dead ends: 1692 [2024-10-13 01:36:57,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2024-10-13 01:36:57,299 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 412 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:36:57,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 408 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:36:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2024-10-13 01:36:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1202. [2024-10-13 01:36:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 855 states have (on average 1.3005847953216374) internal successors, (1112), 868 states have internal predecessors, (1112), 268 states have call successors, (268), 78 states have call predecessors, (268), 78 states have return successors, (268), 255 states have call predecessors, (268), 268 states have call successors, (268) [2024-10-13 01:36:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1648 transitions. [2024-10-13 01:36:57,463 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1648 transitions. Word has length 127 [2024-10-13 01:36:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:36:57,463 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1648 transitions. [2024-10-13 01:36:57,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2024-10-13 01:36:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1648 transitions. [2024-10-13 01:36:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 01:36:57,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:36:57,466 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:57,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 01:36:57,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 01:36:57,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:36:57,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:36:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1909291243, now seen corresponding path program 1 times [2024-10-13 01:36:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:36:57,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271273702] [2024-10-13 01:36:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:36:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:36:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106879704] [2024-10-13 01:36:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:36:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:57,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:36:57,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:36:57,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 01:36:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:36:58,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:36:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:36:58,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:36:58,160 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:36:58,162 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:36:58,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 01:36:58,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:36:58,368 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:36:58,481 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:36:58,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:36:58 BoogieIcfgContainer [2024-10-13 01:36:58,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:36:58,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:36:58,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:36:58,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:36:58,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:36:40" (3/4) ... [2024-10-13 01:36:58,490 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:36:58,491 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:36:58,492 INFO L158 Benchmark]: Toolchain (without parser) took 19559.46ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 86.2MB in the beginning and 93.8MB in the end (delta: -7.5MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. [2024-10-13 01:36:58,492 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 157.3MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:36:58,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.74ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 121.9MB in the end (delta: -35.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-10-13 01:36:58,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.85ms. Allocated memory is still 157.3MB. Free memory was 121.9MB in the beginning and 117.2MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 01:36:58,492 INFO L158 Benchmark]: Boogie Preprocessor took 98.78ms. Allocated memory is still 157.3MB. Free memory was 117.2MB in the beginning and 110.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 01:36:58,493 INFO L158 Benchmark]: RCFGBuilder took 706.87ms. Allocated memory is still 157.3MB. Free memory was 110.9MB in the beginning and 81.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 01:36:58,493 INFO L158 Benchmark]: TraceAbstraction took 18220.88ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 80.4MB in the beginning and 93.8MB in the end (delta: -13.3MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. [2024-10-13 01:36:58,493 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 281.0MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:36:58,494 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 157.3MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.74ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 121.9MB in the end (delta: -35.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.85ms. Allocated memory is still 157.3MB. Free memory was 121.9MB in the beginning and 117.2MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.78ms. Allocated memory is still 157.3MB. Free memory was 117.2MB in the beginning and 110.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 706.87ms. Allocated memory is still 157.3MB. Free memory was 110.9MB in the beginning and 81.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18220.88ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 80.4MB in the beginning and 93.8MB in the end (delta: -13.3MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 281.0MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] float var_1_26 = 500.65; [L38] float var_1_30 = 9.8; [L39] unsigned char var_1_31 = 4; [L40] unsigned short int var_1_34 = 1; [L41] unsigned long int var_1_35 = 10; [L42] unsigned char var_1_36 = 10; [L43] unsigned char var_1_38 = 16; [L44] unsigned char var_1_39 = 0; [L45] unsigned short int var_1_40 = 10; [L46] unsigned short int var_1_41 = 128; [L47] unsigned short int var_1_42 = 40597; [L48] signed short int last_1_var_1_1 = 16; [L49] unsigned char last_1_var_1_6 = 10; [L50] unsigned char last_1_var_1_8 = 1; [L51] signed short int last_1_var_1_13 = 200; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L171] last_1_var_1_1 = var_1_1 [L172] last_1_var_1_6 = var_1_6 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_13 = var_1_13 [L184] RET updateLastVariables() [L185] CALL updateVariables() [L141] var_1_5 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L142] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L143] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L143] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L144] var_1_7 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L145] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L146] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L146] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L150] var_1_12 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L151] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L152] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L154] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L155] var_1_16 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L156] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L157] var_1_20 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L158] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L159] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L160] var_1_38 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L161] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L162] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L163] var_1_39 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L164] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L165] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L166] var_1_42 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L167] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L168] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] signed long int stepLocal_6 = last_1_var_1_1; [L56] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L57] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L58] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L61] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L66] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=457, var_1_8=1] [L69] COND TRUE var_1_5 >= -2 [L70] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L72] unsigned char stepLocal_4 = var_1_6; [L73] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L74] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L75] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L76] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L83] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L84] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L87] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L88] COND TRUE \read(var_1_19) [L89] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L95] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L96] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=1] [L97] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L104] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L106] COND TRUE var_1_11 || var_1_8 [L107] var_1_21 = ((var_1_7 > -4) || var_1_11) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L109] COND FALSE !(((var_1_1 + 25) % var_1_7) < 2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L112] COND TRUE (- var_1_15) < ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16))) [L113] var_1_30 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L115] COND TRUE ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_5)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_5))) <= var_1_1 [L116] var_1_31 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=457, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L118] COND TRUE var_1_6 < ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) [L119] var_1_34 = ((((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) > (var_1_7)) ? (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=457, var_1_34=201, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L121] COND TRUE \read(var_1_11) [L122] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=457, var_1_34=201, var_1_35=201, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L124] COND TRUE \read(var_1_11) [L125] var_1_36 = (var_1_7 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=457, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L129] COND TRUE (- var_1_7) != var_1_6 [L130] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=457, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L132] COND FALSE !(var_1_7 <= (~ var_1_7)) [L137] var_1_41 = var_1_6 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=457, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=457, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=457, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=457, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=457, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 1888 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1862 mSDsluCounter, 4085 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2859 mSDsCounter, 497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2999 IncrementalHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 497 mSolverCounterUnsat, 1226 mSDtfsCounter, 2999 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1674 GetRequests, 1503 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1202occurred in iteration=11, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1690 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2272 NumberOfCodeBlocks, 2272 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2003 ConstructedInterpolants, 1 QuantifiedInterpolants, 9136 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1629 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 9345/9792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:36:58,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:37:00,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:37:00,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:37:00,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:37:00,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:37:00,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:37:00,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:37:00,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:37:00,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:37:00,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:37:00,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:37:00,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:37:00,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:37:00,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:37:00,948 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:37:00,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:37:00,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:37:00,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:37:00,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:37:00,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:37:00,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:37:00,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:37:00,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:37:00,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:37:00,954 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:37:00,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:37:00,955 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:37:00,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:37:00,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:37:00,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:37:00,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:37:00,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:37:00,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:37:00,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:37:00,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:37:00,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:37:00,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:37:00,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:37:00,958 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:37:00,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:37:00,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:37:00,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:37:00,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:37:00,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:37:00,975 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:37:00,975 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9 [2024-10-13 01:37:01,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:37:01,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:37:01,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:37:01,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:37:01,323 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:37:01,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-10-13 01:37:02,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:37:03,129 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:37:03,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-10-13 01:37:03,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82f3f9a2/bdc7e30095d143948954cbd9e655b692/FLAGea9467174 [2024-10-13 01:37:03,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82f3f9a2/bdc7e30095d143948954cbd9e655b692 [2024-10-13 01:37:03,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:37:03,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:37:03,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:37:03,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:37:03,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:37:03,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:03,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6872ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03, skipping insertion in model container [2024-10-13 01:37:03,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:03,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:37:03,656 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i[919,932] [2024-10-13 01:37:03,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:37:03,768 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:37:03,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i[919,932] [2024-10-13 01:37:03,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:37:03,873 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:37:03,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03 WrapperNode [2024-10-13 01:37:03,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:37:03,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:37:03,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:37:03,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:37:03,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:03,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:03,944 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-13 01:37:03,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:37:03,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:37:03,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:37:03,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:37:03,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:03,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:03,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:03,996 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:37:03,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:03,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:04,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:04,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:04,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:04,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:04,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:37:04,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:37:04,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:37:04,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:37:04,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (1/1) ... [2024-10-13 01:37:04,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:37:04,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:37:04,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:37:04,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:37:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:37:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:37:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:37:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:37:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:37:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:37:04,229 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:37:04,232 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:37:04,794 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 01:37:04,795 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:37:04,860 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:37:04,861 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:37:04,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:04 BoogieIcfgContainer [2024-10-13 01:37:04,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:37:04,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:37:04,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:37:04,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:37:04,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:37:03" (1/3) ... [2024-10-13 01:37:04,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55986b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:37:04, skipping insertion in model container [2024-10-13 01:37:04,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:37:03" (2/3) ... [2024-10-13 01:37:04,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55986b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:37:04, skipping insertion in model container [2024-10-13 01:37:04,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:37:04" (3/3) ... [2024-10-13 01:37:04,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-10-13 01:37:04,890 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:37:04,891 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:37:04,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:37:05,005 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1613d54e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:37:05,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:37:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 46 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 01:37:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 01:37:05,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:05,025 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:05,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:05,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1856398152, now seen corresponding path program 1 times [2024-10-13 01:37:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:05,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131412960] [2024-10-13 01:37:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:05,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:05,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:05,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:05,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:37:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:05,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:37:05,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 01:37:05,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:37:05,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131412960] [2024-10-13 01:37:05,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131412960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:05,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:05,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:37:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223970530] [2024-10-13 01:37:05,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:37:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:05,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:37:05,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:37:05,461 INFO L87 Difference]: Start difference. First operand has 66 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 46 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 01:37:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:05,584 INFO L93 Difference]: Finished difference Result 128 states and 228 transitions. [2024-10-13 01:37:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:37:05,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-10-13 01:37:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:05,602 INFO L225 Difference]: With dead ends: 128 [2024-10-13 01:37:05,603 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 01:37:05,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:37:05,611 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:05,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 01:37:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 01:37:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 01:37:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2024-10-13 01:37:05,671 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 125 [2024-10-13 01:37:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:05,672 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2024-10-13 01:37:05,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 01:37:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2024-10-13 01:37:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 01:37:05,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:05,678 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:05,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:37:05,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:05,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:05,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash -969613252, now seen corresponding path program 1 times [2024-10-13 01:37:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:05,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131793096] [2024-10-13 01:37:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:05,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:05,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:05,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:05,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 01:37:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:06,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 01:37:06,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:37:06,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:37:06,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131793096] [2024-10-13 01:37:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131793096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:06,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:37:06,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302184761] [2024-10-13 01:37:06,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:06,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:06,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:06,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:06,541 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:06,902 INFO L93 Difference]: Finished difference Result 188 states and 296 transitions. [2024-10-13 01:37:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:06,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-13 01:37:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:06,913 INFO L225 Difference]: With dead ends: 188 [2024-10-13 01:37:06,917 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 01:37:06,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:37:06,919 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:06,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 280 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:37:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 01:37:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2024-10-13 01:37:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 01:37:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2024-10-13 01:37:06,955 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 125 [2024-10-13 01:37:06,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:06,955 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2024-10-13 01:37:06,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2024-10-13 01:37:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:37:06,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:06,958 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:06,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 01:37:07,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:07,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:07,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:07,160 INFO L85 PathProgramCache]: Analyzing trace with hash 897220106, now seen corresponding path program 1 times [2024-10-13 01:37:07,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:07,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327246372] [2024-10-13 01:37:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:07,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:07,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:07,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:07,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 01:37:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:07,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:37:07,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:37:08,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:37:08,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327246372] [2024-10-13 01:37:08,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327246372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:08,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:08,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:37:08,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677047880] [2024-10-13 01:37:08,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:08,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:37:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:08,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:37:08,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:37:08,153 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:09,850 INFO L93 Difference]: Finished difference Result 291 states and 463 transitions. [2024-10-13 01:37:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:37:09,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:37:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:09,859 INFO L225 Difference]: With dead ends: 291 [2024-10-13 01:37:09,859 INFO L226 Difference]: Without dead ends: 229 [2024-10-13 01:37:09,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:37:09,861 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 145 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:09,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 435 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 01:37:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-13 01:37:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 157. [2024-10-13 01:37:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 01:37:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 245 transitions. [2024-10-13 01:37:09,904 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 245 transitions. Word has length 126 [2024-10-13 01:37:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:09,904 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 245 transitions. [2024-10-13 01:37:09,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 245 transitions. [2024-10-13 01:37:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:37:09,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:09,907 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:09,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 01:37:10,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:10,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:10,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -908218228, now seen corresponding path program 1 times [2024-10-13 01:37:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:10,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601545776] [2024-10-13 01:37:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:10,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:10,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:10,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 01:37:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:10,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 01:37:10,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:37:10,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:37:10,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601545776] [2024-10-13 01:37:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601545776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:10,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:37:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837182653] [2024-10-13 01:37:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:10,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:37:10,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:10,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:37:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:37:10,380 INFO L87 Difference]: Start difference. First operand 157 states and 245 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:10,519 INFO L93 Difference]: Finished difference Result 279 states and 438 transitions. [2024-10-13 01:37:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:37:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:37:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:10,529 INFO L225 Difference]: With dead ends: 279 [2024-10-13 01:37:10,529 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 01:37:10,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:37:10,532 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:10,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:37:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 01:37:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-13 01:37:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 01:37:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2024-10-13 01:37:10,571 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 126 [2024-10-13 01:37:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:10,572 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2024-10-13 01:37:10,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2024-10-13 01:37:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:37:10,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:10,574 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:10,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 01:37:10,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:10,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1798401166, now seen corresponding path program 1 times [2024-10-13 01:37:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352645077] [2024-10-13 01:37:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:10,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:10,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:10,780 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:10,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 01:37:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:11,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:37:11,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-10-13 01:37:11,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-10-13 01:37:11,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352645077] [2024-10-13 01:37:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352645077] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:37:11,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:37:11,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-13 01:37:11,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050133512] [2024-10-13 01:37:11,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:37:11,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 01:37:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 01:37:11,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:37:11,734 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-13 01:37:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:12,923 INFO L93 Difference]: Finished difference Result 346 states and 498 transitions. [2024-10-13 01:37:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 01:37:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 126 [2024-10-13 01:37:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:12,927 INFO L225 Difference]: With dead ends: 346 [2024-10-13 01:37:12,927 INFO L226 Difference]: Without dead ends: 284 [2024-10-13 01:37:12,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 01:37:12,929 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 190 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:12,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 567 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 01:37:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-13 01:37:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 258. [2024-10-13 01:37:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 173 states have (on average 1.329479768786127) internal successors, (230), 173 states have internal predecessors, (230), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 01:37:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2024-10-13 01:37:12,963 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 126 [2024-10-13 01:37:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:12,964 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2024-10-13 01:37:12,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-13 01:37:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2024-10-13 01:37:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:37:12,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:12,971 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:12,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 01:37:13,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:13,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:13,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:13,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2017255884, now seen corresponding path program 1 times [2024-10-13 01:37:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:13,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730546249] [2024-10-13 01:37:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:13,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:13,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:13,176 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:13,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 01:37:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:13,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 01:37:13,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 01:37:13,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:13,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730546249] [2024-10-13 01:37:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730546249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836062241] [2024-10-13 01:37:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:37:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:37:13,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 01:37:13,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-13 01:37:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:14,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 01:37:14,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:37:14,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:37:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1836062241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:14,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:37:14,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-13 01:37:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018644340] [2024-10-13 01:37:14,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:14,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 01:37:14,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:14,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 01:37:14,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:37:14,992 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:17,673 INFO L93 Difference]: Finished difference Result 774 states and 1138 transitions. [2024-10-13 01:37:17,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:37:17,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:37:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:17,685 INFO L225 Difference]: With dead ends: 774 [2024-10-13 01:37:17,685 INFO L226 Difference]: Without dead ends: 637 [2024-10-13 01:37:17,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:37:17,690 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 176 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:17,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 458 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 01:37:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-13 01:37:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 555. [2024-10-13 01:37:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 401 states have (on average 1.3840399002493766) internal successors, (555), 403 states have internal predecessors, (555), 130 states have call successors, (130), 23 states have call predecessors, (130), 23 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-13 01:37:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 815 transitions. [2024-10-13 01:37:17,776 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 815 transitions. Word has length 126 [2024-10-13 01:37:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:17,776 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 815 transitions. [2024-10-13 01:37:17,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 815 transitions. [2024-10-13 01:37:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:37:17,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:17,780 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:17,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 01:37:17,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-13 01:37:18,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 01:37:18,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:18,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:18,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1855009586, now seen corresponding path program 1 times [2024-10-13 01:37:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343770553] [2024-10-13 01:37:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:18,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:18,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:18,186 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:18,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 01:37:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:18,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 01:37:18,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:37:18,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:37:18,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343770553] [2024-10-13 01:37:18,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343770553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:18,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:37:18,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:37:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397150744] [2024-10-13 01:37:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:18,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:37:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:18,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:37:18,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:18,746 INFO L87 Difference]: Start difference. First operand 555 states and 815 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:19,262 INFO L93 Difference]: Finished difference Result 1466 states and 2162 transitions. [2024-10-13 01:37:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:37:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:37:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:19,271 INFO L225 Difference]: With dead ends: 1466 [2024-10-13 01:37:19,271 INFO L226 Difference]: Without dead ends: 1036 [2024-10-13 01:37:19,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:37:19,274 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 120 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:19,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 293 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:37:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-10-13 01:37:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 867. [2024-10-13 01:37:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 629 states have (on average 1.3879173290937996) internal successors, (873), 631 states have internal predecessors, (873), 202 states have call successors, (202), 35 states have call predecessors, (202), 35 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2024-10-13 01:37:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1277 transitions. [2024-10-13 01:37:19,371 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1277 transitions. Word has length 126 [2024-10-13 01:37:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:19,372 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1277 transitions. [2024-10-13 01:37:19,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1277 transitions. [2024-10-13 01:37:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 01:37:19,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:19,376 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:19,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 01:37:19,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:19,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:19,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1628764042, now seen corresponding path program 1 times [2024-10-13 01:37:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:19,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411546306] [2024-10-13 01:37:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:19,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:19,588 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:19,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 01:37:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:19,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 01:37:19,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 01:37:20,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:20,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:20,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411546306] [2024-10-13 01:37:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411546306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:37:20,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [177590867] [2024-10-13 01:37:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:20,769 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:37:20,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:37:20,771 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 01:37:20,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-13 01:37:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:21,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 01:37:21,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 01:37:22,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:37:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [177590867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:37:22,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:37:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-13 01:37:22,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209848804] [2024-10-13 01:37:22,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:37:22,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:37:22,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:22,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:37:22,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:37:22,308 INFO L87 Difference]: Start difference. First operand 867 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:23,761 INFO L93 Difference]: Finished difference Result 1739 states and 2568 transitions. [2024-10-13 01:37:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:37:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-13 01:37:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:23,768 INFO L225 Difference]: With dead ends: 1739 [2024-10-13 01:37:23,768 INFO L226 Difference]: Without dead ends: 929 [2024-10-13 01:37:23,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:37:23,771 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 95 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:23,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 425 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 01:37:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-10-13 01:37:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 863. [2024-10-13 01:37:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 625 states have (on average 1.3776) internal successors, (861), 627 states have internal predecessors, (861), 202 states have call successors, (202), 35 states have call predecessors, (202), 35 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2024-10-13 01:37:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1265 transitions. [2024-10-13 01:37:23,863 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1265 transitions. Word has length 126 [2024-10-13 01:37:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:23,863 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1265 transitions. [2024-10-13 01:37:23,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 01:37:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1265 transitions. [2024-10-13 01:37:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 01:37:23,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:23,865 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:23,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-10-13 01:37:24,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 01:37:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:24,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:24,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1684611475, now seen corresponding path program 1 times [2024-10-13 01:37:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:24,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169070606] [2024-10-13 01:37:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:24,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:24,269 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:24,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 01:37:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:24,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:37:24,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:37:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 01:37:24,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:37:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 01:37:26,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:37:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169070606] [2024-10-13 01:37:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169070606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:37:26,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:37:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 01:37:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411362400] [2024-10-13 01:37:26,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:37:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 01:37:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:37:26,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 01:37:26,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:37:26,810 INFO L87 Difference]: Start difference. First operand 863 states and 1265 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-10-13 01:37:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:37:33,853 INFO L93 Difference]: Finished difference Result 1675 states and 2365 transitions. [2024-10-13 01:37:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 01:37:33,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 127 [2024-10-13 01:37:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:37:33,861 INFO L225 Difference]: With dead ends: 1675 [2024-10-13 01:37:33,861 INFO L226 Difference]: Without dead ends: 1313 [2024-10-13 01:37:33,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 01:37:33,864 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 329 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:37:33,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 289 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 01:37:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-10-13 01:37:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1050. [2024-10-13 01:37:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 776 states have (on average 1.3543814432989691) internal successors, (1051), 786 states have internal predecessors, (1051), 218 states have call successors, (218), 55 states have call predecessors, (218), 55 states have return successors, (218), 208 states have call predecessors, (218), 218 states have call successors, (218) [2024-10-13 01:37:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1487 transitions. [2024-10-13 01:37:33,966 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1487 transitions. Word has length 127 [2024-10-13 01:37:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:37:33,967 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1487 transitions. [2024-10-13 01:37:33,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-10-13 01:37:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1487 transitions. [2024-10-13 01:37:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 01:37:33,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:37:33,974 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:37:33,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 01:37:34,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:34,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:37:34,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:37:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1909291243, now seen corresponding path program 1 times [2024-10-13 01:37:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:37:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113627700] [2024-10-13 01:37:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:37:34,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:37:34,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:37:34,177 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:37:34,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 01:37:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:37:34,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 01:37:34,400 INFO L278 TraceCheckSpWp]: Computing forward predicates...