./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_operatoramount_amount100_file-37.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_operatoramount_amount100_file-37.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 f4da2059a4cb972f9fd86e1b50a915414e86a3432d84cf94afece8f8e6c08d77 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:51:04,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:51:04,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:51:04,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:51:04,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:51:04,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:51:04,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:51:04,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:51:04,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:51:04,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:51:04,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:51:04,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:51:04,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:51:04,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:51:04,537 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:51:04,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:51:04,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:51:04,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:51:04,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:51:04,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:51:04,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:51:04,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:51:04,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:51:04,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:51:04,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:51:04,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:51:04,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:51:04,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:51:04,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:51:04,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:51:04,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:51:04,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:51:04,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:51:04,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:51:04,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:51:04,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:51:04,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:51:04,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:51:04,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:51:04,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:51:04,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:51:04,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:51:04,548 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 -> f4da2059a4cb972f9fd86e1b50a915414e86a3432d84cf94afece8f8e6c08d77 [2024-10-13 04:51:04,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:51:04,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:51:04,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:51:04,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:51:04,867 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:51:04,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-37.i [2024-10-13 04:51:06,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:51:06,602 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:51:06,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-37.i [2024-10-13 04:51:06,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41f9ffa8/2a2d466ad0f3490fb082749d37b2e118/FLAGb3dd801b5 [2024-10-13 04:51:06,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41f9ffa8/2a2d466ad0f3490fb082749d37b2e118 [2024-10-13 04:51:06,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:51:06,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:51:06,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:51:06,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:51:06,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:51:06,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:51:06" (1/1) ... [2024-10-13 04:51:06,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ee71d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:06, skipping insertion in model container [2024-10-13 04:51:06,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:51:06" (1/1) ... [2024-10-13 04:51:06,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:51:06,903 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_operatoramount_amount100_file-37.i[916,929] [2024-10-13 04:51:07,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:51:07,039 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:51:07,054 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_operatoramount_amount100_file-37.i[916,929] [2024-10-13 04:51:07,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:51:07,140 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:51:07,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07 WrapperNode [2024-10-13 04:51:07,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:51:07,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:51:07,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:51:07,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:51:07,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,216 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 231 [2024-10-13 04:51:07,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:51:07,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:51:07,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:51:07,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:51:07,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,267 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 04:51:07,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:51:07,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:51:07,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:51:07,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:51:07,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (1/1) ... [2024-10-13 04:51:07,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:51:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:51:07,351 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 04:51:07,355 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 04:51:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:51:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:51:07,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:51:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:51:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:51:07,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:51:07,524 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:51:07,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:51:08,114 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-13 04:51:08,114 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:51:08,228 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:51:08,229 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:51:08,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:51:08 BoogieIcfgContainer [2024-10-13 04:51:08,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:51:08,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:51:08,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:51:08,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:51:08,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:51:06" (1/3) ... [2024-10-13 04:51:08,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ada3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:51:08, skipping insertion in model container [2024-10-13 04:51:08,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:51:07" (2/3) ... [2024-10-13 04:51:08,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ada3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:51:08, skipping insertion in model container [2024-10-13 04:51:08,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:51:08" (3/3) ... [2024-10-13 04:51:08,248 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-37.i [2024-10-13 04:51:08,269 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:51:08,269 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:51:08,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:51:08,349 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;@21a844ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:51:08,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:51:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.5625) internal successors, (100), 65 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:51:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 04:51:08,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:51:08,368 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:08,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:51:08,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:51:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash 324896029, now seen corresponding path program 1 times [2024-10-13 04:51:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:51:08,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787731587] [2024-10-13 04:51:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:08,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:51:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:51:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:51:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:51:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:51:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:51:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:51:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:51:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:51:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:51:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:51:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:51:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:51:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:51:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:51:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:51:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:51:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:51:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:51:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:51:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:51:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 04:51:08,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:51:08,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787731587] [2024-10-13 04:51:08,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787731587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:51:08,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:51:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:51:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153470900] [2024-10-13 04:51:08,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:51:08,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:51:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:51:08,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:51:08,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:51:08,989 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.5625) internal successors, (100), 65 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:51:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:51:09,050 INFO L93 Difference]: Finished difference Result 171 states and 298 transitions. [2024-10-13 04:51:09,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:51:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-10-13 04:51:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:51:09,063 INFO L225 Difference]: With dead ends: 171 [2024-10-13 04:51:09,063 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 04:51:09,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 04:51:09,070 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:51:09,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:51:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 04:51:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 04:51:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.507936507936508) internal successors, (95), 63 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:51:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2024-10-13 04:51:09,118 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 133 [2024-10-13 04:51:09,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:51:09,119 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2024-10-13 04:51:09,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:51:09,120 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2024-10-13 04:51:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 04:51:09,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:51:09,125 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:51:09,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:51:09,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:51:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 438140385, now seen corresponding path program 1 times [2024-10-13 04:51:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:51:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570522492] [2024-10-13 04:51:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:51:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:51:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:51:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:51:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:51:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:51:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:51:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:51:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:51:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:51:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:51:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:51:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:51:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:51:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:51:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:51:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:51:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:51:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:51:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:51:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:51:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 04:51:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:51:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570522492] [2024-10-13 04:51:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570522492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:51:09,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:51:09,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:51:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855194233] [2024-10-13 04:51:09,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:51:09,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:51:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:51:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:51:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:51:09,617 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 04:51:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:51:09,747 INFO L93 Difference]: Finished difference Result 250 states and 397 transitions. [2024-10-13 04:51:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:51:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-10-13 04:51:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:51:09,754 INFO L225 Difference]: With dead ends: 250 [2024-10-13 04:51:09,754 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 04:51:09,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 04:51:09,759 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 120 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:51:09,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 284 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:51:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 04:51:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-10-13 04:51:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.462809917355372) internal successors, (177), 121 states have internal predecessors, (177), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 04:51:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 257 transitions. [2024-10-13 04:51:09,799 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 257 transitions. Word has length 133 [2024-10-13 04:51:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:51:09,804 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 257 transitions. [2024-10-13 04:51:09,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 04:51:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 257 transitions. [2024-10-13 04:51:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 04:51:09,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:51:09,807 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:09,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:51:09,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:51:09,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:51:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2082025621, now seen corresponding path program 1 times [2024-10-13 04:51:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:51:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152410462] [2024-10-13 04:51:09,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:09,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:51:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:51:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:51:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:51:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:51:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:51:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:51:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:51:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:51:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:51:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:51:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:51:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:51:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:51:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:51:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:51:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:51:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:51:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:51:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:51:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:51:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 04:51:10,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:51:10,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152410462] [2024-10-13 04:51:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152410462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:51:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:51:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:51:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615754797] [2024-10-13 04:51:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:51:10,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:51:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:51:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:51:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:51:10,431 INFO L87 Difference]: Start difference. First operand 164 states and 257 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 04:51:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:51:10,963 INFO L93 Difference]: Finished difference Result 379 states and 586 transitions. [2024-10-13 04:51:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:51:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-10-13 04:51:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:51:10,967 INFO L225 Difference]: With dead ends: 379 [2024-10-13 04:51:10,967 INFO L226 Difference]: Without dead ends: 216 [2024-10-13 04:51:10,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:51:10,976 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 174 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:51:10,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 592 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:51:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-13 04:51:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2024-10-13 04:51:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 164 states have (on average 1.4329268292682926) internal successors, (235), 165 states have internal predecessors, (235), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 04:51:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2024-10-13 04:51:11,029 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 134 [2024-10-13 04:51:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:51:11,032 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2024-10-13 04:51:11,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 04:51:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2024-10-13 04:51:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 04:51:11,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:51:11,039 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:11,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:51:11,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:51:11,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:51:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -864176852, now seen corresponding path program 1 times [2024-10-13 04:51:11,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:51:11,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910610088] [2024-10-13 04:51:11,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:11,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:51:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:51:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:51:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:51:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:51:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:51:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:51:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:51:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:51:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:51:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:51:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:51:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:51:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:51:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:51:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:51:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:51:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:51:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:51:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:51:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:51:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 04:51:11,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:51:11,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910610088] [2024-10-13 04:51:11,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910610088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:51:11,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:51:11,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:51:11,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051172373] [2024-10-13 04:51:11,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:51:11,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:51:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:51:11,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:51:11,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:51:11,483 INFO L87 Difference]: Start difference. First operand 211 states and 319 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 04:51:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:51:11,909 INFO L93 Difference]: Finished difference Result 437 states and 651 transitions. [2024-10-13 04:51:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:51:11,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2024-10-13 04:51:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:51:11,915 INFO L225 Difference]: With dead ends: 437 [2024-10-13 04:51:11,915 INFO L226 Difference]: Without dead ends: 227 [2024-10-13 04:51:11,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:51:11,920 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 152 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:51:11,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 581 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:51:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-13 04:51:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 188. [2024-10-13 04:51:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 143 states have internal predecessors, (203), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 04:51:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2024-10-13 04:51:11,951 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 135 [2024-10-13 04:51:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:51:11,952 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2024-10-13 04:51:11,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 04:51:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2024-10-13 04:51:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 04:51:11,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:51:11,958 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:11,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:51:11,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:51:11,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:51:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash -559708688, now seen corresponding path program 1 times [2024-10-13 04:51:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:51:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337991592] [2024-10-13 04:51:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:51:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:51:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:51:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:51:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:51:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:51:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:51:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:51:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:51:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:51:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:51:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:51:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:51:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:51:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:51:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:51:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:51:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:51:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:51:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:51:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:51:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 04:51:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:51:12,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337991592] [2024-10-13 04:51:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337991592] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:51:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23442517] [2024-10-13 04:51:12,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:12,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:51:12,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:51:12,807 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 04:51:12,809 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 04:51:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:12,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:51:12,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:51:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 393 proven. 24 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-13 04:51:13,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:51:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 04:51:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23442517] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:51:13,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:51:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-13 04:51:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277958443] [2024-10-13 04:51:13,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:51:13,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 04:51:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:51:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 04:51:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:51:13,447 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 04:51:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:51:13,742 INFO L93 Difference]: Finished difference Result 296 states and 443 transitions. [2024-10-13 04:51:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:51:13,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 136 [2024-10-13 04:51:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:51:13,745 INFO L225 Difference]: With dead ends: 296 [2024-10-13 04:51:13,745 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 04:51:13,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-13 04:51:13,747 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 233 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:51:13,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 225 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:51:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 04:51:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2024-10-13 04:51:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:51:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-10-13 04:51:13,760 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 136 [2024-10-13 04:51:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:51:13,761 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-13 04:51:13,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 04:51:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-10-13 04:51:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 04:51:13,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:51:13,763 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:13,783 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 04:51:13,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:51:13,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:51:13,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:51:13,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2146307473, now seen corresponding path program 1 times [2024-10-13 04:51:13,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:51:13,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096097505] [2024-10-13 04:51:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:13,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:51:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:51:14,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003390920] [2024-10-13 04:51:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:14,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:51:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:51:14,268 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 04:51:14,269 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 04:51:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:14,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 04:51:14,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:51:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 402 proven. 78 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-13 04:51:15,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:51:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-13 04:51:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:51:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096097505] [2024-10-13 04:51:17,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:51:17,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003390920] [2024-10-13 04:51:17,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003390920] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:51:17,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:51:17,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2024-10-13 04:51:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537570441] [2024-10-13 04:51:17,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:51:17,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 04:51:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:51:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 04:51:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-10-13 04:51:17,987 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-10-13 04:51:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:51:25,069 INFO L93 Difference]: Finished difference Result 553 states and 758 transitions. [2024-10-13 04:51:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-13 04:51:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) Word has length 137 [2024-10-13 04:51:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:51:25,073 INFO L225 Difference]: With dead ends: 553 [2024-10-13 04:51:25,074 INFO L226 Difference]: Without dead ends: 463 [2024-10-13 04:51:25,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1495, Invalid=4511, Unknown=0, NotChecked=0, Total=6006 [2024-10-13 04:51:25,078 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 2348 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:51:25,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2351 Valid, 882 Invalid, 2407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 04:51:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-13 04:51:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 304. [2024-10-13 04:51:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 04:51:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 416 transitions. [2024-10-13 04:51:25,166 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 416 transitions. Word has length 137 [2024-10-13 04:51:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:51:25,167 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 416 transitions. [2024-10-13 04:51:25,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-10-13 04:51:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 416 transitions. [2024-10-13 04:51:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 04:51:25,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:51:25,169 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:25,191 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 04:51:25,370 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,SelfDestructingSolverStorable5 [2024-10-13 04:51:25,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:51:25,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:51:25,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1561853809, now seen corresponding path program 1 times [2024-10-13 04:51:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:51:25,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174761764] [2024-10-13 04:51:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:51:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:51:25,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60435909] [2024-10-13 04:51:25,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:25,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:51:25,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:51:25,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:51:25,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 04:51:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:25,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 04:51:25,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:51:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 502 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:51:27,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:51:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:51:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174761764] [2024-10-13 04:51:35,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:51:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60435909] [2024-10-13 04:51:35,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60435909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:51:35,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:51:35,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2024-10-13 04:51:35,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590901354] [2024-10-13 04:51:35,392 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 04:51:35,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 04:51:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:51:35,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 04:51:35,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=440, Unknown=1, NotChecked=0, Total=552 [2024-10-13 04:51:35,394 INFO L87 Difference]: Start difference. First operand 304 states and 416 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 17 states have internal predecessors, (61), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-13 04:51:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:51:37,505 INFO L93 Difference]: Finished difference Result 543 states and 735 transitions. [2024-10-13 04:51:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 04:51:37,507 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 17 states have internal predecessors, (61), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 137 [2024-10-13 04:51:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:51:37,509 INFO L225 Difference]: With dead ends: 543 [2024-10-13 04:51:37,509 INFO L226 Difference]: Without dead ends: 329 [2024-10-13 04:51:37,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=416, Invalid=1475, Unknown=1, NotChecked=0, Total=1892 [2024-10-13 04:51:37,512 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 302 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:51:37,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 660 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 04:51:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-13 04:51:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 312. [2024-10-13 04:51:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 234 states have internal predecessors, (301), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 04:51:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 421 transitions. [2024-10-13 04:51:37,606 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 421 transitions. Word has length 137 [2024-10-13 04:51:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:51:37,607 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 421 transitions. [2024-10-13 04:51:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 17 states have internal predecessors, (61), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-13 04:51:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 421 transitions. [2024-10-13 04:51:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 04:51:37,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:51:37,609 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:37,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 04:51:37,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:51:37,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:51:37,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:51:37,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2014646317, now seen corresponding path program 1 times [2024-10-13 04:51:37,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:51:37,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106713211] [2024-10-13 04:51:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:51:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:51:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060164362] [2024-10-13 04:51:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:51:38,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:51:38,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:51:38,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:51:38,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 04:51:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:51:38,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 04:51:38,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:51:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 522 proven. 114 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 04:51:40,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:51:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:51:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106713211] [2024-10-13 04:51:58,890 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:51:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060164362] [2024-10-13 04:51:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060164362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:51:58,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:51:58,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2024-10-13 04:51:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891722589] [2024-10-13 04:51:58,891 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 04:51:58,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 04:51:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:51:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 04:51:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=470, Unknown=3, NotChecked=0, Total=600 [2024-10-13 04:51:58,892 INFO L87 Difference]: Start difference. First operand 312 states and 421 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 17 states have internal predecessors, (64), 7 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) [2024-10-13 04:52:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:52:00,818 INFO L93 Difference]: Finished difference Result 451 states and 615 transitions. [2024-10-13 04:52:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 04:52:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 17 states have internal predecessors, (64), 7 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) Word has length 137 [2024-10-13 04:52:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:52:00,821 INFO L225 Difference]: With dead ends: 451 [2024-10-13 04:52:00,821 INFO L226 Difference]: Without dead ends: 331 [2024-10-13 04:52:00,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=417, Invalid=1386, Unknown=3, NotChecked=0, Total=1806 [2024-10-13 04:52:00,826 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 85 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 04:52:00,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 669 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 04:52:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-13 04:52:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 312. [2024-10-13 04:52:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 234 states have internal predecessors, (300), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 04:52:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 420 transitions. [2024-10-13 04:52:00,893 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 420 transitions. Word has length 137 [2024-10-13 04:52:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:52:00,894 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 420 transitions. [2024-10-13 04:52:00,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 17 states have internal predecessors, (64), 7 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) [2024-10-13 04:52:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 420 transitions. [2024-10-13 04:52:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 04:52:00,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:52:00,898 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:52:00,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 04:52:01,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:52:01,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:52:01,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:52:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1388058625, now seen corresponding path program 1 times [2024-10-13 04:52:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:52:01,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266806440] [2024-10-13 04:52:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:52:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:52:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:52:01,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997143034] [2024-10-13 04:52:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:52:01,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:52:01,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:52:01,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:52:01,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 04:52:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:52:01,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:52:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:52:01,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:52:01,752 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:52:01,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:52:01,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 04:52:01,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:52:01,959 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:52:02,093 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:52:02,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:52:02 BoogieIcfgContainer [2024-10-13 04:52:02,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:52:02,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:52:02,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:52:02,100 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:52:02,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:51:08" (3/4) ... [2024-10-13 04:52:02,102 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:52:02,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:52:02,104 INFO L158 Benchmark]: Toolchain (without parser) took 55464.55ms. Allocated memory was 127.9MB in the beginning and 356.5MB in the end (delta: 228.6MB). Free memory was 58.3MB in the beginning and 134.2MB in the end (delta: -75.8MB). Peak memory consumption was 154.1MB. Max. memory is 16.1GB. [2024-10-13 04:52:02,104 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 127.9MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:52:02,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.70ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 58.1MB in the beginning and 121.1MB in the end (delta: -63.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-10-13 04:52:02,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.11ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 116.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:52:02,105 INFO L158 Benchmark]: Boogie Preprocessor took 85.28ms. Allocated memory is still 163.6MB. Free memory was 116.9MB in the beginning and 111.2MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:52:02,106 INFO L158 Benchmark]: RCFGBuilder took 925.82ms. Allocated memory is still 163.6MB. Free memory was 111.2MB in the beginning and 126.9MB in the end (delta: -15.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 04:52:02,106 INFO L158 Benchmark]: TraceAbstraction took 53863.90ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 126.9MB in the beginning and 134.2MB in the end (delta: -7.3MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2024-10-13 04:52:02,106 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 356.5MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:52:02,107 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.20ms. Allocated memory is still 127.9MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.70ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 58.1MB in the beginning and 121.1MB in the end (delta: -63.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.11ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 116.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.28ms. Allocated memory is still 163.6MB. Free memory was 116.9MB in the beginning and 111.2MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 925.82ms. Allocated memory is still 163.6MB. Free memory was 111.2MB in the beginning and 126.9MB in the end (delta: -15.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 53863.90ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 126.9MB in the beginning and 134.2MB in the end (delta: -7.3MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 356.5MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryArithmeticFLOAToperation at line 75, overapproximation of someUnaryFLOAToperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 10; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 5; [L27] double var_1_7 = 4.175; [L28] unsigned char var_1_9 = 100; [L29] unsigned short int var_1_10 = 128; [L30] float var_1_11 = 10.6; [L31] float var_1_12 = 16.25; [L32] float var_1_13 = 0.0; [L33] float var_1_14 = 127.2; [L34] double var_1_15 = 0.75; [L35] unsigned char var_1_18 = 1; [L36] unsigned char var_1_19 = 1; [L37] signed char var_1_20 = 1; [L38] signed short int var_1_21 = -1; [L39] unsigned long int var_1_22 = 1000000000; [L40] signed long int var_1_23 = -50; [L41] unsigned long int var_1_24 = 3900988395; [L42] unsigned long int var_1_25 = 2230016845; [L43] unsigned long int var_1_26 = 256; [L44] unsigned long int var_1_27 = 4; [L45] signed char var_1_29 = 8; [L46] signed long int last_1_var_1_1 = 2; [L47] unsigned char last_1_var_1_9 = 100; [L48] unsigned short int last_1_var_1_10 = 128; [L49] double last_1_var_1_15 = 0.75; [L50] signed short int last_1_var_1_21 = -1; [L51] unsigned long int last_1_var_1_22 = 1000000000; [L52] unsigned long int last_1_var_1_27 = 4; [L53] signed char last_1_var_1_29 = 8; [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L173] last_1_var_1_1 = var_1_1 [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_10 = var_1_10 [L176] last_1_var_1_15 = var_1_15 [L177] last_1_var_1_21 = var_1_21 [L178] last_1_var_1_22 = var_1_22 [L179] last_1_var_1_27 = var_1_27 [L180] last_1_var_1_29 = var_1_29 [L190] RET updateLastVariables() [L191] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L143] var_1_3 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L144] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L147] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L149] var_1_5 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L152] var_1_12 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L153] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L154] var_1_13 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L155] RET assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L156] var_1_14 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L157] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L161] var_1_23 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L162] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L165] var_1_24 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_24 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L166] RET assume_abort_if_not(var_1_24 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] CALL assume_abort_if_not(var_1_24 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] RET assume_abort_if_not(var_1_24 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L168] var_1_25 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_25 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L169] RET assume_abort_if_not(var_1_25 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L191] RET updateVariables() [L192] CALL step() [L57] signed long int stepLocal_3 = last_1_var_1_1 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_3=16, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L58] COND TRUE var_1_5 == stepLocal_3 [L59] var_1_21 = ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L63] signed long int stepLocal_4 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_4=128, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L64] COND TRUE (var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= stepLocal_4 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L65] COND TRUE \read(var_1_19) [L66] var_1_22 = (var_1_24 - (last_1_var_1_9 + var_1_4)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L71] COND TRUE last_1_var_1_15 < (- var_1_14) [L72] var_1_18 = (var_1_2 || var_1_19) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L74] var_1_10 = ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4))) [L75] var_1_11 = (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13)))) [L76] var_1_20 = var_1_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L77] COND TRUE var_1_21 != 10 [L78] var_1_9 = ((((var_1_4) > (2)) ? (var_1_4) : (2))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L90] signed short int stepLocal_2 = var_1_21; [L91] unsigned long int stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, stepLocal_2=-13699, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L92] COND FALSE !((var_1_9 * (var_1_4 * var_1_5)) < stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L99] COND TRUE \read(var_1_18) [L100] var_1_15 = ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L112] signed long int stepLocal_0 = 500 * var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=2147483420, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L113] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=2147483420, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L114] COND FALSE !((var_1_3 - (var_1_4 - var_1_5)) >= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L120] COND TRUE var_1_18 && var_1_19 [L121] var_1_27 = ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=16, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L123] COND TRUE (var_1_13 - var_1_14) <= var_1_12 [L124] var_1_26 = (var_1_25 - var_1_27) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L128] unsigned char stepLocal_5 = var_1_13 < var_1_15; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, stepLocal_5=1, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L129] COND TRUE var_1_18 || stepLocal_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L130] COND TRUE (((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15 [L131] var_1_29 = (var_1_5 - 10) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483420, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183] EXPR ((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183-L184] return ((((((((((((var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1)) && ((var_1_21 != 10) ? (var_1_9 == ((unsigned char) ((((var_1_4) > (2)) ? (var_1_4) : (2))))) : ((var_1_22 > (var_1_21 / 128)) ? (var_1_18 ? (var_1_9 == ((unsigned char) var_1_4)) : (var_1_9 == ((unsigned char) var_1_5))) : (var_1_9 == ((unsigned char) var_1_4))))) && (var_1_10 == ((unsigned short int) ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4)))))) && (var_1_11 == ((float) (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13))))))) && (var_1_18 ? (var_1_15 == ((double) ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : ((var_1_22 < var_1_4) ? ((var_1_18 || var_1_18) ? (var_1_15 == ((double) var_1_14)) : (var_1_15 == ((double) var_1_14))) : (var_1_15 == ((double) var_1_13))))) && ((last_1_var_1_15 < (- var_1_14)) ? (var_1_18 == ((unsigned char) (var_1_2 || var_1_19))) : 1)) && (var_1_20 == ((signed char) var_1_5))) && ((var_1_5 == (last_1_var_1_1 * last_1_var_1_29)) ? (var_1_21 == ((signed short int) ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))))) : (var_1_21 == ((signed short int) ((((last_1_var_1_21) > (var_1_4)) ? (last_1_var_1_21) : (var_1_4))))))) && (((var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= last_1_var_1_10) ? (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_24 - (last_1_var_1_9 + var_1_4)))) : (var_1_22 == ((unsigned long int) (((((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) < (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))) ? ((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) : (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))))))) : 1)) && (((var_1_13 - var_1_14) <= var_1_12) ? (var_1_26 == ((unsigned long int) (var_1_25 - var_1_27))) : (var_1_26 == ((unsigned long int) ((((var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) < 0 ) ? -(var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) : (var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))))))))) && ((var_1_18 && var_1_19) ? (var_1_27 == ((unsigned long int) ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))))) : 1)) && ((var_1_18 || (var_1_13 < var_1_15)) ? (((((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15) ? (var_1_29 == ((signed char) (var_1_5 - 10))) : (var_1_29 == ((signed char) var_1_5))) : (var_1_29 == ((signed char) var_1_5))) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=2147483420, var_1_23=15, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.6s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3418 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3414 mSDsluCounter, 4025 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3040 mSDsCounter, 700 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4396 IncrementalHoareTripleChecker+Invalid, 5096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 700 mSolverCounterUnsat, 985 mSDtfsCounter, 4396 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1263 GetRequests, 1077 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2831 ImplicationChecksByTransitivity, 26.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=7, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 259 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 36.5s InterpolantComputationTime, 1905 NumberOfCodeBlocks, 1905 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1480 ConstructedInterpolants, 0 QuantifiedInterpolants, 9317 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1422 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 7901/8360 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 04:52:02,325 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-13 04:52:02,382 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 137 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_operatoramount_amount100_file-37.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 f4da2059a4cb972f9fd86e1b50a915414e86a3432d84cf94afece8f8e6c08d77 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:52:04,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:52:04,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:52:04,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:52:04,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:52:04,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:52:04,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:52:04,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:52:04,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:52:04,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:52:04,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:52:04,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:52:04,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:52:04,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:52:04,552 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:52:04,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:52:04,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:52:04,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:52:04,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:52:04,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:52:04,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:52:04,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:52:04,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:52:04,558 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:52:04,558 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:52:04,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:52:04,558 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:52:04,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:52:04,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:52:04,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:52:04,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:52:04,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:52:04,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:52:04,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:52:04,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:52:04,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:52:04,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:52:04,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:52:04,562 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:52:04,563 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:52:04,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:52:04,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:52:04,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:52:04,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:52:04,565 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:52:04,565 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 -> f4da2059a4cb972f9fd86e1b50a915414e86a3432d84cf94afece8f8e6c08d77 [2024-10-13 04:52:04,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:52:04,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:52:04,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:52:04,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:52:04,946 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:52:04,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-37.i [2024-10-13 04:52:06,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:52:06,764 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:52:06,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-37.i [2024-10-13 04:52:06,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f43c52a/518ff1a5f5774d48a9f5743994693dff/FLAG64c36d019 [2024-10-13 04:52:07,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f43c52a/518ff1a5f5774d48a9f5743994693dff [2024-10-13 04:52:07,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:52:07,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:52:07,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:52:07,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:52:07,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:52:07,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3769d6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07, skipping insertion in model container [2024-10-13 04:52:07,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:52:07,331 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_operatoramount_amount100_file-37.i[916,929] [2024-10-13 04:52:07,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:52:07,453 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:52:07,466 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_operatoramount_amount100_file-37.i[916,929] [2024-10-13 04:52:07,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:52:07,545 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:52:07,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07 WrapperNode [2024-10-13 04:52:07,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:52:07,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:52:07,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:52:07,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:52:07,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,632 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-10-13 04:52:07,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:52:07,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:52:07,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:52:07,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:52:07,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,681 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 04:52:07,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:52:07,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:52:07,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:52:07,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:52:07,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (1/1) ... [2024-10-13 04:52:07,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:52:07,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:52:07,768 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 04:52:07,775 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 04:52:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:52:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:52:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:52:07,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:52:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:52:07,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:52:07,923 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:52:07,925 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:52:22,238 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 04:52:22,238 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:52:22,309 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:52:22,309 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:52:22,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:52:22 BoogieIcfgContainer [2024-10-13 04:52:22,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:52:22,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:52:22,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:52:22,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:52:22,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:52:07" (1/3) ... [2024-10-13 04:52:22,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b2d75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:52:22, skipping insertion in model container [2024-10-13 04:52:22,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:52:07" (2/3) ... [2024-10-13 04:52:22,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b2d75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:52:22, skipping insertion in model container [2024-10-13 04:52:22,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:52:22" (3/3) ... [2024-10-13 04:52:22,321 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-37.i [2024-10-13 04:52:22,336 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:52:22,337 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:52:22,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:52:22,429 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;@2429fa1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:52:22,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:52:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 46 states have internal predecessors, (69), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:52:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 04:52:22,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:52:22,449 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:52:22,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:52:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:52:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash 646876174, now seen corresponding path program 1 times [2024-10-13 04:52:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:52:22,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32114441] [2024-10-13 04:52:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:52:22,472 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 04:52:22,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:52:22,475 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 04:52:22,476 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