./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_loopvsstraightlinecode_100-1loop_file-13.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_loopvsstraightlinecode_100-1loop_file-13.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 56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:43:23,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:43:23,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:43:23,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:43:23,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:43:23,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:43:23,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:43:23,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:43:23,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:43:23,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:43:23,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:43:23,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:43:23,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:43:23,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:43:23,472 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:43:23,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:43:23,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:43:23,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:43:23,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:43:23,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:43:23,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:43:23,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:43:23,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:43:23,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:43:23,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:43:23,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:43:23,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:43:23,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:43:23,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:43:23,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:43:23,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:43:23,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:43:23,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:23,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:43:23,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:43:23,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:43:23,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:43:23,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:43:23,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:43:23,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:43:23,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:43:23,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:43:23,482 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 -> 56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118 [2024-10-13 03:43:23,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:43:23,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:43:23,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:43:23,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:43:23,715 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:43:23,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-10-13 03:43:24,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:43:25,155 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:43:25,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-10-13 03:43:25,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10113830e/c4f711a9f9c84c5f810423ad8a92474c/FLAG1add6a9ca [2024-10-13 03:43:25,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10113830e/c4f711a9f9c84c5f810423ad8a92474c [2024-10-13 03:43:25,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:43:25,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:43:25,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:25,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:43:25,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:43:25,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f55970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25, skipping insertion in model container [2024-10-13 03:43:25,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:43:25,342 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_loopvsstraightlinecode_100-1loop_file-13.i[916,929] [2024-10-13 03:43:25,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:25,437 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:43:25,449 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_loopvsstraightlinecode_100-1loop_file-13.i[916,929] [2024-10-13 03:43:25,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:25,546 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:43:25,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25 WrapperNode [2024-10-13 03:43:25,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:25,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:25,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:43:25,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:43:25,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,593 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-10-13 03:43:25,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:25,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:43:25,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:43:25,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:43:25,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,622 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 03:43:25,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:43:25,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:43:25,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:43:25,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:43:25,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (1/1) ... [2024-10-13 03:43:25,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:25,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:25,682 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 03:43:25,684 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 03:43:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:43:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:43:25,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:43:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:43:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:43:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:43:25,822 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:43:25,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:43:26,195 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-13 03:43:26,195 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:43:26,223 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:43:26,224 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:43:26,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:26 BoogieIcfgContainer [2024-10-13 03:43:26,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:43:26,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:43:26,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:43:26,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:43:26,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:43:25" (1/3) ... [2024-10-13 03:43:26,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de858a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:26, skipping insertion in model container [2024-10-13 03:43:26,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:25" (2/3) ... [2024-10-13 03:43:26,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de858a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:26, skipping insertion in model container [2024-10-13 03:43:26,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:26" (3/3) ... [2024-10-13 03:43:26,234 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-10-13 03:43:26,248 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:43:26,248 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:43:26,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:43:26,302 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;@2cb4b894, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:43:26,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:43:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.492537313432836) internal successors, (100), 68 states have internal predecessors, (100), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 03:43:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 03:43:26,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:26,321 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:26,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:26,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash 281128378, now seen corresponding path program 1 times [2024-10-13 03:43:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:26,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685234098] [2024-10-13 03:43:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:43:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 03:43:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:43:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:43:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:43:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:43:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:43:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:43:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:43:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 03:43:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 03:43:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 03:43:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685234098] [2024-10-13 03:43:26,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685234098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:26,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:26,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:43:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182768337] [2024-10-13 03:43:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:26,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:43:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:43:26,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:43:26,756 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.492537313432836) internal successors, (100), 68 states have internal predecessors, (100), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 03:43:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:26,808 INFO L93 Difference]: Finished difference Result 195 states and 342 transitions. [2024-10-13 03:43:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:43:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-10-13 03:43:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:26,837 INFO L225 Difference]: With dead ends: 195 [2024-10-13 03:43:26,838 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 03:43:26,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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 03:43:26,846 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:26,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:43:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 03:43:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 03:43:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 03:43:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2024-10-13 03:43:26,896 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 188 [2024-10-13 03:43:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:26,897 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-13 03:43:26,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 03:43:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2024-10-13 03:43:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 03:43:26,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:26,901 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:26,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:43:26,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2137189572, now seen corresponding path program 1 times [2024-10-13 03:43:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:26,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111552485] [2024-10-13 03:43:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:26,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:43:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 03:43:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:43:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:43:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:43:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:43:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:43:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:43:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:43:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 03:43:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 03:43:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 03:43:27,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:27,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111552485] [2024-10-13 03:43:27,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111552485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:27,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:27,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:43:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207783026] [2024-10-13 03:43:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:27,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:43:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:27,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:43:27,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:43:27,339 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:43:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:27,581 INFO L93 Difference]: Finished difference Result 307 states and 483 transitions. [2024-10-13 03:43:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:43:27,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-13 03:43:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:27,585 INFO L225 Difference]: With dead ends: 307 [2024-10-13 03:43:27,585 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 03:43:27,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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 03:43:27,587 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 189 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:27,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 398 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:43:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 03:43:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2024-10-13 03:43:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 142 states have (on average 1.4577464788732395) internal successors, (207), 142 states have internal predecessors, (207), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 03:43:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 323 transitions. [2024-10-13 03:43:27,626 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 323 transitions. Word has length 188 [2024-10-13 03:43:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:27,628 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 323 transitions. [2024-10-13 03:43:27,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:43:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 323 transitions. [2024-10-13 03:43:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 03:43:27,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:27,635 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:27,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:43:27,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:27,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash 318476141, now seen corresponding path program 1 times [2024-10-13 03:43:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:27,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64575716] [2024-10-13 03:43:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:43:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 03:43:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:43:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:43:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:43:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:43:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:43:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:43:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:43:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:27,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 03:43:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 03:43:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 03:43:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:28,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64575716] [2024-10-13 03:43:28,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64575716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:28,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:28,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:43:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791105230] [2024-10-13 03:43:28,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:28,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:43:28,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:28,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:43:28,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:43:28,009 INFO L87 Difference]: Start difference. First operand 203 states and 323 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:43:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:28,073 INFO L93 Difference]: Finished difference Result 604 states and 961 transitions. [2024-10-13 03:43:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:43:28,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2024-10-13 03:43:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:28,081 INFO L225 Difference]: With dead ends: 604 [2024-10-13 03:43:28,081 INFO L226 Difference]: Without dead ends: 402 [2024-10-13 03:43:28,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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 03:43:28,084 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 142 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:28,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 382 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:43:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-13 03:43:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2024-10-13 03:43:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 279 states have (on average 1.4336917562724014) internal successors, (400), 279 states have internal predecessors, (400), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-13 03:43:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 632 transitions. [2024-10-13 03:43:28,129 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 632 transitions. Word has length 189 [2024-10-13 03:43:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:28,131 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 632 transitions. [2024-10-13 03:43:28,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:43:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 632 transitions. [2024-10-13 03:43:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 03:43:28,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:28,133 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:28,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:43:28,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:28,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1805432789, now seen corresponding path program 1 times [2024-10-13 03:43:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404873666] [2024-10-13 03:43:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:43:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 03:43:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:43:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:43:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:43:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:43:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:43:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:43:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:43:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 03:43:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 03:43:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 03:43:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404873666] [2024-10-13 03:43:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404873666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:28,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:28,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:43:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011687699] [2024-10-13 03:43:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:28,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:43:28,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:43:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:43:28,494 INFO L87 Difference]: Start difference. First operand 400 states and 632 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:43:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:28,674 INFO L93 Difference]: Finished difference Result 1391 states and 2198 transitions. [2024-10-13 03:43:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:43:28,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2024-10-13 03:43:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:28,707 INFO L225 Difference]: With dead ends: 1391 [2024-10-13 03:43:28,710 INFO L226 Difference]: Without dead ends: 992 [2024-10-13 03:43:28,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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 03:43:28,715 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 216 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:28,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 469 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:43:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-10-13 03:43:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 988. [2024-10-13 03:43:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 687 states have (on average 1.3944687045123727) internal successors, (958), 687 states have internal predecessors, (958), 290 states have call successors, (290), 10 states have call predecessors, (290), 10 states have return successors, (290), 290 states have call predecessors, (290), 290 states have call successors, (290) [2024-10-13 03:43:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1538 transitions. [2024-10-13 03:43:28,809 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1538 transitions. Word has length 189 [2024-10-13 03:43:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:28,810 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1538 transitions. [2024-10-13 03:43:28,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:43:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1538 transitions. [2024-10-13 03:43:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 03:43:28,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:28,815 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:28,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:43:28,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:28,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash -961387537, now seen corresponding path program 1 times [2024-10-13 03:43:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:28,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903310160] [2024-10-13 03:43:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:28,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:43:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 03:43:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:43:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:43:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:43:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:43:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:43:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:43:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:43:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 03:43:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 03:43:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 03:43:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:29,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903310160] [2024-10-13 03:43:29,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903310160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:29,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:29,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:43:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709598143] [2024-10-13 03:43:29,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:29,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:43:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:43:29,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:43:29,071 INFO L87 Difference]: Start difference. First operand 988 states and 1538 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:43:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:29,524 INFO L93 Difference]: Finished difference Result 2744 states and 4250 transitions. [2024-10-13 03:43:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:43:29,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2024-10-13 03:43:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:29,534 INFO L225 Difference]: With dead ends: 2744 [2024-10-13 03:43:29,534 INFO L226 Difference]: Without dead ends: 1757 [2024-10-13 03:43:29,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:43:29,539 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 378 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:29,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 885 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:43:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2024-10-13 03:43:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1685. [2024-10-13 03:43:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1144 states have (on average 1.3732517482517483) internal successors, (1571), 1144 states have internal predecessors, (1571), 522 states have call successors, (522), 18 states have call predecessors, (522), 18 states have return successors, (522), 522 states have call predecessors, (522), 522 states have call successors, (522) [2024-10-13 03:43:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2615 transitions. [2024-10-13 03:43:29,677 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2615 transitions. Word has length 189 [2024-10-13 03:43:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:29,678 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 2615 transitions. [2024-10-13 03:43:29,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:43:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2615 transitions. [2024-10-13 03:43:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 03:43:29,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:29,680 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:29,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:43:29,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 626960365, now seen corresponding path program 1 times [2024-10-13 03:43:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142237548] [2024-10-13 03:43:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:43:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 03:43:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:43:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:43:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:43:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:43:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:43:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:43:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:43:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 03:43:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 03:43:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 03:43:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142237548] [2024-10-13 03:43:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142237548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:43:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653454040] [2024-10-13 03:43:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:30,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:30,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:30,607 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 03:43:30,609 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 03:43:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 03:43:30,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:43:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 541 proven. 24 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-13 03:43:31,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:43:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653454040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:43:33,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:43:33,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2024-10-13 03:43:33,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669375068] [2024-10-13 03:43:33,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:43:33,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 03:43:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:33,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 03:43:33,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 03:43:33,059 INFO L87 Difference]: Start difference. First operand 1685 states and 2615 transitions. Second operand has 25 states, 25 states have (on average 3.88) internal successors, (97), 24 states have internal predecessors, (97), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) [2024-10-13 03:43:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:43,422 INFO L93 Difference]: Finished difference Result 8710 states and 12936 transitions. [2024-10-13 03:43:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2024-10-13 03:43:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 24 states have internal predecessors, (97), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) Word has length 189 [2024-10-13 03:43:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:43,468 INFO L225 Difference]: With dead ends: 8710 [2024-10-13 03:43:43,468 INFO L226 Difference]: Without dead ends: 8225 [2024-10-13 03:43:43,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20127 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6550, Invalid=43850, Unknown=0, NotChecked=0, Total=50400 [2024-10-13 03:43:43,488 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 3266 mSDsluCounter, 5255 mSDsCounter, 0 mSdLazyCounter, 6120 mSolverCounterSat, 1714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3383 SdHoareTripleChecker+Valid, 5780 SdHoareTripleChecker+Invalid, 7834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1714 IncrementalHoareTripleChecker+Valid, 6120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:43,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3383 Valid, 5780 Invalid, 7834 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1714 Valid, 6120 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-13 03:43:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8225 states. [2024-10-13 03:43:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8225 to 5492. [2024-10-13 03:43:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5492 states, 3816 states have (on average 1.3587526205450733) internal successors, (5185), 3853 states have internal predecessors, (5185), 1561 states have call successors, (1561), 114 states have call predecessors, (1561), 114 states have return successors, (1561), 1524 states have call predecessors, (1561), 1561 states have call successors, (1561) [2024-10-13 03:43:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 8307 transitions. [2024-10-13 03:43:43,923 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 8307 transitions. Word has length 189 [2024-10-13 03:43:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:43,924 INFO L471 AbstractCegarLoop]: Abstraction has 5492 states and 8307 transitions. [2024-10-13 03:43:43,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 24 states have internal predecessors, (97), 5 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58) [2024-10-13 03:43:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 8307 transitions. [2024-10-13 03:43:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 03:43:43,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:43,926 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:43,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:43:44,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 03:43:44,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:44,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash 885125803, now seen corresponding path program 1 times [2024-10-13 03:43:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:44,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27402946] [2024-10-13 03:43:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:43:44,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566680365] [2024-10-13 03:43:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:44,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:44,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:44,308 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 03:43:44,309 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 03:43:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:43:44,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:43:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:43:44,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:43:44,583 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:43:44,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:43:44,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 03:43:44,790 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,SelfDestructingSolverStorable6 [2024-10-13 03:43:44,793 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:44,904 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:43:44,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:43:44 BoogieIcfgContainer [2024-10-13 03:43:44,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:43:44,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:43:44,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:43:44,907 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:43:44,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:26" (3/4) ... [2024-10-13 03:43:44,909 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:43:44,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:43:44,911 INFO L158 Benchmark]: Toolchain (without parser) took 19727.40ms. Allocated memory was 159.4MB in the beginning and 612.4MB in the end (delta: 453.0MB). Free memory was 87.4MB in the beginning and 392.6MB in the end (delta: -305.2MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. [2024-10-13 03:43:44,911 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:43:44,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.82ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 87.2MB in the beginning and 201.4MB in the end (delta: -114.2MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-10-13 03:43:44,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.20ms. Allocated memory is still 230.7MB. Free memory was 201.4MB in the beginning and 197.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:43:44,911 INFO L158 Benchmark]: Boogie Preprocessor took 50.24ms. Allocated memory is still 230.7MB. Free memory was 197.2MB in the beginning and 192.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:43:44,912 INFO L158 Benchmark]: RCFGBuilder took 579.40ms. Allocated memory is still 230.7MB. Free memory was 192.9MB in the beginning and 159.4MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 03:43:44,912 INFO L158 Benchmark]: TraceAbstraction took 18679.27ms. Allocated memory was 230.7MB in the beginning and 612.4MB in the end (delta: 381.7MB). Free memory was 158.4MB in the beginning and 393.6MB in the end (delta: -235.2MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. [2024-10-13 03:43:44,912 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 612.4MB. Free memory is still 392.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:43:44,913 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.15ms. Allocated memory is still 159.4MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.82ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 87.2MB in the beginning and 201.4MB in the end (delta: -114.2MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.20ms. Allocated memory is still 230.7MB. Free memory was 201.4MB in the beginning and 197.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.24ms. Allocated memory is still 230.7MB. Free memory was 197.2MB in the beginning and 192.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 579.40ms. Allocated memory is still 230.7MB. Free memory was 192.9MB in the beginning and 159.4MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18679.27ms. Allocated memory was 230.7MB in the beginning and 612.4MB in the end (delta: 381.7MB). Free memory was 158.4MB in the beginning and 393.6MB in the end (delta: -235.2MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 612.4MB. Free memory is still 392.6MB. 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 someBinaryDOUBLEComparisonOperation at line 208, overapproximation of someBinaryFLOATComparisonOperation at line 208, overapproximation of someBinaryArithmeticDOUBLEoperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_5 = 25; [L24] signed short int var_1_7 = 128; [L25] signed short int var_1_8 = 256; [L26] signed char var_1_9 = -10; [L27] signed char var_1_10 = -16; [L28] signed char var_1_11 = -10; [L29] signed char var_1_12 = -25; [L30] double var_1_13 = 64.875; [L31] double var_1_15 = 1.625; [L32] double var_1_16 = 32.2; [L33] double var_1_17 = 8.6; [L34] double var_1_18 = 10.5; [L35] double var_1_19 = 4.25; [L36] float var_1_20 = 64.5; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] signed long int var_1_25 = -5; [L41] unsigned char var_1_26 = 1; [L42] unsigned char var_1_28 = 0; [L43] signed long int var_1_29 = -10; [L44] float var_1_30 = 10.4; [L45] unsigned long int var_1_31 = 8; [L46] unsigned short int var_1_32 = 47145; [L47] unsigned short int var_1_33 = 17741; [L48] unsigned short int var_1_34 = 2; [L49] unsigned long int var_1_35 = 3282184810; [L50] signed short int last_1_var_1_5 = 25; [L51] signed char last_1_var_1_9 = -10; [L52] double last_1_var_1_13 = 64.875; [L53] signed long int last_1_var_1_25 = -5; [L54] unsigned char last_1_var_1_26 = 1; [L55] signed long int last_1_var_1_29 = -10; [L56] unsigned long int last_1_var_1_31 = 8; [L212] isInitial = 1 [L213] FCALL initially() [L214] int k_loop; [L215] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=128, var_1_8=256, var_1_9=-10] [L215] COND TRUE k_loop < 1 [L216] CALL updateLastVariables() [L199] last_1_var_1_5 = var_1_5 [L200] last_1_var_1_9 = var_1_9 [L201] last_1_var_1_13 = var_1_13 [L202] last_1_var_1_25 = var_1_25 [L203] last_1_var_1_26 = var_1_26 [L204] last_1_var_1_29 = var_1_29 [L205] last_1_var_1_31 = var_1_31 [L216] RET updateLastVariables() [L217] CALL updateVariables() [L151] var_1_7 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L152] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L153] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L153] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=256, var_1_9=-10] [L154] var_1_8 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L155] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L156] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L156] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-16, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L157] var_1_10 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_10 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L158] RET assume_abort_if_not(var_1_10 >= -31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L159] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L159] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=-10, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L160] var_1_11 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L161] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L162] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L162] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=-25, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L163] var_1_12 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L164] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L165] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L165] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=13/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L166] var_1_15 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_15 >= 0.0F && 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=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L167] RET assume_abort_if_not((var_1_15 >= 0.0F && 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=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_16=161/5, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L168] var_1_16 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_16 >= 0.0F && 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=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L169] RET assume_abort_if_not((var_1_16 >= 0.0F && 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=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_17=43/5, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L170] var_1_17 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L171] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_18=21/2, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L172] var_1_18 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L173] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_19=17/4, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L174] var_1_19 = __VERIFIER_nondet_double() [L175] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L175] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L176] var_1_23 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L177] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L178] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L178] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L179] var_1_24 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L180] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L181] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L181] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=0, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L182] var_1_28 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L183] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L184] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L184] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=47145, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L185] var_1_32 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_32 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L186] RET assume_abort_if_not(var_1_32 >= 32767) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L187] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L187] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=17741, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L188] var_1_33 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_33 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L189] RET assume_abort_if_not(var_1_33 >= 16383) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L190] CALL assume_abort_if_not(var_1_33 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L190] RET assume_abort_if_not(var_1_33 <= 32767) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=2, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L191] var_1_34 = __VERIFIER_nondet_ushort() [L192] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L192] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L193] CALL assume_abort_if_not(var_1_34 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L193] RET assume_abort_if_not(var_1_34 <= 16383) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=3282184810, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L194] var_1_35 = __VERIFIER_nondet_ulong() [L195] CALL assume_abort_if_not(var_1_35 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L195] RET assume_abort_if_not(var_1_35 >= 3221225471) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L196] CALL assume_abort_if_not(var_1_35 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L196] RET assume_abort_if_not(var_1_35 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L217] RET updateVariables() [L218] CALL step() [L60] unsigned char stepLocal_4 = last_1_var_1_9 >= 4; [L61] signed long int stepLocal_3 = last_1_var_1_9 % 50; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_3=-10, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L62] EXPR last_1_var_1_9 & last_1_var_1_9 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_3=-10, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=1, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L62] unsigned char stepLocal_2 = (- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9); [L63] COND FALSE !(last_1_var_1_25 < stepLocal_3) [L78] var_1_26 = var_1_24 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L80] COND FALSE !(9.6 <= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L85] unsigned char stepLocal_5 = var_1_24; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_5=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=-10, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L86] COND FALSE !(stepLocal_5 && (var_1_17 != var_1_19)) [L91] var_1_29 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L93] unsigned long int stepLocal_0 = last_1_var_1_31; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_0=8, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=-10] [L94] COND TRUE stepLocal_0 > var_1_7 [L95] var_1_9 = ((var_1_10 + var_1_11) + var_1_12) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_1=1, var_1_20=129/2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L97] COND TRUE (var_1_9 * (var_1_8 - 128)) < var_1_10 [L98] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L100] COND FALSE !((var_1_9 <= var_1_29) || var_1_22) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L103] unsigned long int stepLocal_9 = (var_1_35 - var_1_32) - ((((var_1_8) < (var_1_33)) ? (var_1_8) : (var_1_33))); [L104] signed long int stepLocal_8 = var_1_29; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_8=25, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L105] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_8=25, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L106] COND FALSE !((var_1_32 - (var_1_33 - var_1_34)) >= stepLocal_8) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L116] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_1=49, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_13=519/8, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L117] COND TRUE stepLocal_1 > var_1_31 [L118] var_1_13 = ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=25, var_1_7=0, var_1_8=26, var_1_9=49] [L126] COND TRUE var_1_1 || var_1_22 [L127] var_1_5 = ((((50) < (var_1_9)) ? (50) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=-5, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L133] COND TRUE var_1_1 && ((var_1_8 >= var_1_29) || var_1_26) [L134] var_1_25 = ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L138] unsigned long int stepLocal_7 = var_1_31; [L139] signed short int stepLocal_6 = var_1_7; VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_6=0, stepLocal_7=8, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=52/5, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L140] COND FALSE !(stepLocal_7 <= var_1_25) [L147] var_1_30 = var_1_16 VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, stepLocal_2=1, stepLocal_4=0, stepLocal_6=0, stepLocal_9=-32795, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L218] RET step() [L219] CALL, EXPR property() [L208] EXPR (((((((((var_1_9 <= var_1_29) || var_1_22) ? (var_1_1 == ((unsigned char) 0)) : 1) && ((var_1_1 || var_1_22) ? (var_1_5 == ((signed short int) ((((50) < (var_1_9)) ? (50) : (var_1_9))))) : (var_1_22 ? (var_1_5 == ((signed short int) (var_1_7 - var_1_8))) : 1))) && ((last_1_var_1_31 > var_1_7) ? (var_1_9 == ((signed char) ((var_1_10 + var_1_11) + var_1_12))) : 1)) && ((var_1_9 > var_1_31) ? (var_1_13 == ((double) ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)))) : (var_1_22 ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_19))))) && (((var_1_9 * (var_1_8 - 128)) < var_1_10) ? (var_1_20 == ((float) var_1_15)) : 1)) && ((9.6 <= last_1_var_1_13) ? ((var_1_19 == 4.125) ? (var_1_22 == ((unsigned char) (var_1_23 || var_1_24))) : 1) : 1)) && ((var_1_1 && ((var_1_8 >= var_1_29) || var_1_26)) ? (var_1_25 == ((signed long int) ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))))) : (var_1_25 == ((signed long int) (var_1_5 + 16))))) && ((last_1_var_1_25 < (last_1_var_1_9 % 50)) ? (((128u <= last_1_var_1_29) && (last_1_var_1_9 >= 4)) ? ((((- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9)) && last_1_var_1_26) ? (var_1_26 == ((unsigned char) var_1_23)) : ((((((var_1_19) < (1.6)) ? (var_1_19) : (1.6))) < (var_1_16 - var_1_15)) ? (var_1_26 == ((unsigned char) (! var_1_28))) : (var_1_26 == ((unsigned char) var_1_23)))) : (var_1_26 == ((unsigned char) var_1_28))) : (var_1_26 == ((unsigned char) var_1_24))) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L208-L209] return ((((((((((((var_1_9 <= var_1_29) || var_1_22) ? (var_1_1 == ((unsigned char) 0)) : 1) && ((var_1_1 || var_1_22) ? (var_1_5 == ((signed short int) ((((50) < (var_1_9)) ? (50) : (var_1_9))))) : (var_1_22 ? (var_1_5 == ((signed short int) (var_1_7 - var_1_8))) : 1))) && ((last_1_var_1_31 > var_1_7) ? (var_1_9 == ((signed char) ((var_1_10 + var_1_11) + var_1_12))) : 1)) && ((var_1_9 > var_1_31) ? (var_1_13 == ((double) ((var_1_15 - var_1_16) + (((((var_1_17) > (499.25)) ? (var_1_17) : (499.25))) + var_1_18)))) : (var_1_22 ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_19))))) && (((var_1_9 * (var_1_8 - 128)) < var_1_10) ? (var_1_20 == ((float) var_1_15)) : 1)) && ((9.6 <= last_1_var_1_13) ? ((var_1_19 == 4.125) ? (var_1_22 == ((unsigned char) (var_1_23 || var_1_24))) : 1) : 1)) && ((var_1_1 && ((var_1_8 >= var_1_29) || var_1_26)) ? (var_1_25 == ((signed long int) ((((var_1_9) < ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7))))) ? (var_1_9) : ((((((var_1_10 + var_1_8)) < (var_1_7)) ? ((var_1_10 + var_1_8)) : (var_1_7)))))))) : (var_1_25 == ((signed long int) (var_1_5 + 16))))) && ((last_1_var_1_25 < (last_1_var_1_9 % 50)) ? (((128u <= last_1_var_1_29) && (last_1_var_1_9 >= 4)) ? ((((- var_1_8) <= (last_1_var_1_9 & last_1_var_1_9)) && last_1_var_1_26) ? (var_1_26 == ((unsigned char) var_1_23)) : ((((((var_1_19) < (1.6)) ? (var_1_19) : (1.6))) < (var_1_16 - var_1_15)) ? (var_1_26 == ((unsigned char) (! var_1_28))) : (var_1_26 == ((unsigned char) var_1_23)))) : (var_1_26 == ((unsigned char) var_1_28))) : (var_1_26 == ((unsigned char) var_1_24)))) && ((var_1_24 && (var_1_17 != var_1_19)) ? ((! last_1_var_1_26) ? (var_1_29 == ((signed long int) -256)) : 1) : (var_1_29 == ((signed long int) last_1_var_1_5)))) && ((var_1_31 <= var_1_25) ? ((var_1_7 > (var_1_12 + var_1_25)) ? (var_1_30 == ((float) (var_1_15 - ((((var_1_16) < (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))) ? (var_1_16) : (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))))) : (var_1_30 == ((float) var_1_18))) : (var_1_30 == ((float) var_1_16)))) && (var_1_1 ? (((var_1_32 - (var_1_33 - var_1_34)) >= var_1_29) ? (var_1_31 == ((unsigned long int) (32u + var_1_33))) : 1) : ((last_1_var_1_31 <= ((var_1_35 - var_1_32) - ((((var_1_8) < (var_1_33)) ? (var_1_8) : (var_1_33))))) ? (var_1_31 == ((unsigned long int) var_1_33)) : (var_1_31 == ((unsigned long int) var_1_8)))) ; [L219] RET, EXPR property() [L219] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=519/8, last_1_var_1_25=-5, last_1_var_1_26=1, last_1_var_1_29=-10, last_1_var_1_31=8, last_1_var_1_5=25, last_1_var_1_9=-10, var_1_10=-25, var_1_11=30, var_1_12=44, var_1_15=2, var_1_16=3, var_1_1=1, var_1_20=2, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=25, var_1_30=3, var_1_31=8, var_1_32=-32769, var_1_33=98280, var_1_34=-65536, var_1_35=-2, var_1_5=49, var_1_7=0, var_1_8=26, var_1_9=49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4308 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4191 mSDsluCounter, 8060 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6385 mSDsCounter, 1900 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6590 IncrementalHoareTripleChecker+Invalid, 8490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1900 mSolverCounterUnsat, 1675 mSDtfsCounter, 6590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 886 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20129 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5492occurred in iteration=6, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 6 MinimizatonAttempts, 2821 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1699 NumberOfCodeBlocks, 1699 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 3279 SizeOfPredicates, 8 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 11329/11368 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 03:43:44,974 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_loopvsstraightlinecode_100-1loop_file-13.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 56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:43:46,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:43:46,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:43:46,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:43:46,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:43:46,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:43:46,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:43:46,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:43:46,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:43:46,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:43:46,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:43:46,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:43:46,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:43:46,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:43:46,919 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:43:46,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:43:46,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:43:46,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:43:46,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:43:46,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:43:46,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:43:46,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:43:46,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:43:46,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:43:46,924 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:43:46,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:43:46,924 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:43:46,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:43:46,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:43:46,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:43:46,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:43:46,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:43:46,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:43:46,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:43:46,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:46,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:43:46,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:43:46,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:43:46,927 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:43:46,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:43:46,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:43:46,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:43:46,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:43:46,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:43:46,930 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:43:46,930 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 -> 56eb992ff485ad1132f413888727e18e4f78f27ce239e6605f19595f145f8118 [2024-10-13 03:43:47,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:43:47,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:43:47,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:43:47,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:43:47,219 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:43:47,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-10-13 03:43:48,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:43:48,722 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:43:48,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-10-13 03:43:48,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174cfa5ac/bd2584a5c9f946f3988440001cbac765/FLAG033ead590 [2024-10-13 03:43:49,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174cfa5ac/bd2584a5c9f946f3988440001cbac765 [2024-10-13 03:43:49,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:43:49,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:43:49,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:49,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:43:49,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:43:49,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fcfbb22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49, skipping insertion in model container [2024-10-13 03:43:49,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:43:49,309 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_loopvsstraightlinecode_100-1loop_file-13.i[916,929] [2024-10-13 03:43:49,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:49,402 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:43:49,413 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_loopvsstraightlinecode_100-1loop_file-13.i[916,929] [2024-10-13 03:43:49,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:49,486 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:43:49,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49 WrapperNode [2024-10-13 03:43:49,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:49,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:49,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:43:49,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:43:49,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,547 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-10-13 03:43:49,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:49,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:43:49,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:43:49,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:43:49,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,593 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 03:43:49,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:43:49,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:43:49,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:43:49,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:43:49,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (1/1) ... [2024-10-13 03:43:49,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:49,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:49,656 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 03:43:49,660 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 03:43:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:43:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:43:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:43:49,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:43:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:43:49,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:43:49,769 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:43:49,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:43:55,798 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-13 03:43:55,798 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:43:55,858 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:43:55,858 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:43:55,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:55 BoogieIcfgContainer [2024-10-13 03:43:55,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:43:55,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:43:55,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:43:55,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:43:55,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:43:49" (1/3) ... [2024-10-13 03:43:55,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0e5fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:55, skipping insertion in model container [2024-10-13 03:43:55,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:49" (2/3) ... [2024-10-13 03:43:55,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0e5fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:55, skipping insertion in model container [2024-10-13 03:43:55,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:55" (3/3) ... [2024-10-13 03:43:55,868 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-13.i [2024-10-13 03:43:55,880 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:43:55,880 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:43:55,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:43:55,933 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;@1c96c211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:43:55,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:43:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 53 states have (on average 1.490566037735849) internal successors, (79), 54 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 03:43:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 03:43:55,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:55,955 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:55,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:55,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash 552950661, now seen corresponding path program 1 times [2024-10-13 03:43:55,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:43:55,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143197315] [2024-10-13 03:43:55,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:55,970 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 03:43:55,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:43:55,972 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 03:43:55,973 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 03:43:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:56,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:43:56,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:43:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-13 03:43:56,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:43:56,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:43:56,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143197315] [2024-10-13 03:43:56,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143197315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:56,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:56,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:43:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834607778] [2024-10-13 03:43:56,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:56,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:43:56,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:43:56,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:43:56,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:43:56,619 INFO L87 Difference]: Start difference. First operand has 85 states, 53 states have (on average 1.490566037735849) internal successors, (79), 54 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 03:44:00,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:44:00,888 INFO L93 Difference]: Finished difference Result 169 states and 302 transitions. [2024-10-13 03:44:00,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:44:00,890 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 184 [2024-10-13 03:44:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:44:00,897 INFO L225 Difference]: With dead ends: 169 [2024-10-13 03:44:00,897 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 03:44:00,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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 03:44:00,903 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:44:00,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 03:44:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 03:44:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 03:44:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 03:44:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions. [2024-10-13 03:44:00,940 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 184 [2024-10-13 03:44:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:44:00,941 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 132 transitions. [2024-10-13 03:44:00,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 03:44:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions. [2024-10-13 03:44:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 03:44:00,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:44:00,946 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:44:00,965 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 03:44:01,147 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 03:44:01,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:44:01,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:44:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash -833376369, now seen corresponding path program 1 times [2024-10-13 03:44:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:44:01,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668791074] [2024-10-13 03:44:01,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:44:01,152 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 03:44:01,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:44:01,154 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 03:44:01,156 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 03:44:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:01,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:44:01,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:44:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 03:44:06,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:44:06,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:44:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668791074] [2024-10-13 03:44:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668791074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:44:06,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:44:06,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:44:06,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822094174] [2024-10-13 03:44:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:44:06,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:44:06,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:44:06,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:44:06,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:44:06,975 INFO L87 Difference]: Start difference. First operand 83 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:44:10,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:15,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:19,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:22,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:27,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:31,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:36,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:44:36,091 INFO L93 Difference]: Finished difference Result 248 states and 395 transitions. [2024-10-13 03:44:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:44:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-10-13 03:44:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:44:36,097 INFO L225 Difference]: With dead ends: 248 [2024-10-13 03:44:36,097 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 03:44:36,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:44:36,100 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 59 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:44:36,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 335 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 29.0s Time] [2024-10-13 03:44:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 03:44:36,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2024-10-13 03:44:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 03:44:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 220 transitions. [2024-10-13 03:44:36,141 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 220 transitions. Word has length 184 [2024-10-13 03:44:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:44:36,142 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 220 transitions. [2024-10-13 03:44:36,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:44:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 220 transitions. [2024-10-13 03:44:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 03:44:36,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:44:36,150 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:44:36,171 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 03:44:36,351 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 03:44:36,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:44:36,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:44:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2089688889, now seen corresponding path program 1 times [2024-10-13 03:44:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:44:36,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328681199] [2024-10-13 03:44:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:44:36,354 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 03:44:36,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:44:36,355 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 03:44:36,356 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 03:44:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:44:36,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:44:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 03:44:37,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:44:37,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:44:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328681199] [2024-10-13 03:44:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328681199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:44:37,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:44:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:44:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943448473] [2024-10-13 03:44:37,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:44:37,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:44:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:44:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:44:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:44:37,070 INFO L87 Difference]: Start difference. First operand 139 states and 220 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:44:41,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:45,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:49,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:44:49,469 INFO L93 Difference]: Finished difference Result 300 states and 476 transitions. [2024-10-13 03:44:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:44:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-10-13 03:44:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:44:49,474 INFO L225 Difference]: With dead ends: 300 [2024-10-13 03:44:49,474 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 03:44:49,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:44:49,479 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 122 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:44:49,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 342 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2024-10-13 03:44:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 03:44:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-10-13 03:44:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 125 states have (on average 1.344) internal successors, (168), 125 states have internal predecessors, (168), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-13 03:44:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 342 transitions. [2024-10-13 03:44:49,510 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 342 transitions. Word has length 185 [2024-10-13 03:44:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:44:49,511 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 342 transitions. [2024-10-13 03:44:49,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 03:44:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 342 transitions. [2024-10-13 03:44:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 03:44:49,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:44:49,513 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:44:49,540 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 03:44:49,714 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 03:44:49,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:44:49,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:44:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1308896843, now seen corresponding path program 1 times [2024-10-13 03:44:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:44:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705451778] [2024-10-13 03:44:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:44:49,716 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 03:44:49,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:44:49,718 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 03:44:49,719 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 03:44:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:50,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 03:44:50,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:44:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 884 proven. 63 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2024-10-13 03:44:53,228 INFO L311 TraceCheckSpWp]: Computing backward predicates...