./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b3751a2ceaae8972d788d7195cbb1b12ec209633513efd66a5d0e24c48ee8e17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:50:24,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:50:24,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:50:24,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:50:24,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:50:24,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:50:24,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:50:24,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:50:24,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:50:24,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:50:24,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:50:24,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:50:24,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:50:24,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:50:24,794 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:50:24,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:50:24,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:50:24,794 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:50:24,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:50:24,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:24,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:24,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:50:24,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:50:24,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:50:24,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:50:24,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:50:24,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:50:24,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:50:24,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:50:24,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:50:24,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b3751a2ceaae8972d788d7195cbb1b12ec209633513efd66a5d0e24c48ee8e17 [2025-01-09 12:50:25,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:50:25,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:50:25,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:50:25,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:50:25,018 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:50:25,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i [2025-01-09 12:50:26,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02af945d0/8e2c27e5d09448ccbbce858620a33f1d/FLAGafd9bc377 [2025-01-09 12:50:26,423 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:50:26,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i [2025-01-09 12:50:26,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02af945d0/8e2c27e5d09448ccbbce858620a33f1d/FLAGafd9bc377 [2025-01-09 12:50:26,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02af945d0/8e2c27e5d09448ccbbce858620a33f1d [2025-01-09 12:50:26,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:50:26,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:50:26,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:50:26,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:50:26,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:50:26,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:26,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26, skipping insertion in model container [2025-01-09 12:50:26,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:26,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:50:26,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i[916,929] [2025-01-09 12:50:26,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:50:26,917 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:50:26,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i[916,929] [2025-01-09 12:50:26,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:50:26,968 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:50:26,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26 WrapperNode [2025-01-09 12:50:26,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:50:26,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:50:26,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:50:26,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:50:26,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:26,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,016 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2025-01-09 12:50:27,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:50:27,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:50:27,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:50:27,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:50:27,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,046 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]. [2025-01-09 12:50:27,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,063 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:50:27,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:50:27,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:50:27,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:50:27,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (1/1) ... [2025-01-09 12:50:27,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:27,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:50:27,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:50:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:50:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:50:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:50:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:50:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:50:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:50:27,195 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:50:27,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:50:27,611 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 12:50:27,612 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:50:27,619 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:50:27,621 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:50:27,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:27 BoogieIcfgContainer [2025-01-09 12:50:27,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:50:27,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:50:27,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:50:27,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:50:27,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:50:26" (1/3) ... [2025-01-09 12:50:27,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143a25cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:27, skipping insertion in model container [2025-01-09 12:50:27,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:26" (2/3) ... [2025-01-09 12:50:27,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143a25cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:27, skipping insertion in model container [2025-01-09 12:50:27,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:27" (3/3) ... [2025-01-09 12:50:27,630 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-22.i [2025-01-09 12:50:27,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:50:27,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-22.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:50:27,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:50:27,722 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;@670a1a4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:50:27,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:50:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 67 states have internal predecessors, (94), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:50:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 12:50:27,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:27,737 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:27,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:27,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash 139973465, now seen corresponding path program 1 times [2025-01-09 12:50:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861543939] [2025-01-09 12:50:27,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:27,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 12:50:27,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 12:50:27,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:27,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 12:50:28,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861543939] [2025-01-09 12:50:28,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861543939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879230955] [2025-01-09 12:50:28,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:28,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:28,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:28,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:50:28,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:50:28,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 12:50:28,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 12:50:28,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:28,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:28,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:50:28,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 12:50:28,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:50:28,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879230955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:28,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:50:28,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:50:28,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609797767] [2025-01-09 12:50:28,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:28,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:50:28,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:28,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:50:28,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:50:28,243 INFO L87 Difference]: Start difference. First operand has 100 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 67 states have internal predecessors, (94), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:50:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:28,274 INFO L93 Difference]: Finished difference Result 197 states and 340 transitions. [2025-01-09 12:50:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:50:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-01-09 12:50:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:28,282 INFO L225 Difference]: With dead ends: 197 [2025-01-09 12:50:28,282 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 12:50:28,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:50:28,286 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:28,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:50:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 12:50:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 12:50:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:50:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 151 transitions. [2025-01-09 12:50:28,328 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 151 transitions. Word has length 199 [2025-01-09 12:50:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:28,328 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 151 transitions. [2025-01-09 12:50:28,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:50:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 151 transitions. [2025-01-09 12:50:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 12:50:28,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:28,333 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:28,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:50:28,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:50:28,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:28,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:28,536 INFO L85 PathProgramCache]: Analyzing trace with hash 889084887, now seen corresponding path program 1 times [2025-01-09 12:50:28,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:28,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105103880] [2025-01-09 12:50:28,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:28,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 12:50:28,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 12:50:28,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:28,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105103880] [2025-01-09 12:50:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105103880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:29,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:29,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:50:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590564106] [2025-01-09 12:50:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:29,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:50:29,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:29,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:50:29,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:50:29,014 INFO L87 Difference]: Start difference. First operand 97 states and 151 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:29,329 INFO L93 Difference]: Finished difference Result 321 states and 502 transitions. [2025-01-09 12:50:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:50:29,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-01-09 12:50:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:29,333 INFO L225 Difference]: With dead ends: 321 [2025-01-09 12:50:29,333 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 12:50:29,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:50:29,336 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 200 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:29,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 604 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:50:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 12:50:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2025-01-09 12:50:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.4217687074829932) internal successors, (209), 147 states have internal predecessors, (209), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 12:50:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 333 transitions. [2025-01-09 12:50:29,367 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 333 transitions. Word has length 199 [2025-01-09 12:50:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:29,368 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 333 transitions. [2025-01-09 12:50:29,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 333 transitions. [2025-01-09 12:50:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 12:50:29,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:29,370 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:29,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:50:29,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -409012502, now seen corresponding path program 1 times [2025-01-09 12:50:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81798834] [2025-01-09 12:50:29,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:29,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 12:50:29,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 12:50:29,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:29,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:29,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81798834] [2025-01-09 12:50:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81798834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:29,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:29,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:50:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113266392] [2025-01-09 12:50:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:29,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:50:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:29,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:50:29,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:50:29,661 INFO L87 Difference]: Start difference. First operand 212 states and 333 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:29,967 INFO L93 Difference]: Finished difference Result 568 states and 885 transitions. [2025-01-09 12:50:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:50:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-01-09 12:50:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:29,972 INFO L225 Difference]: With dead ends: 568 [2025-01-09 12:50:29,974 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 12:50:29,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:50:29,976 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 183 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:29,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 638 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:50:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 12:50:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 304. [2025-01-09 12:50:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 207 states have (on average 1.4009661835748792) internal successors, (290), 207 states have internal predecessors, (290), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:50:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 476 transitions. [2025-01-09 12:50:30,018 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 476 transitions. Word has length 200 [2025-01-09 12:50:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:30,019 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 476 transitions. [2025-01-09 12:50:30,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 476 transitions. [2025-01-09 12:50:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 12:50:30,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:30,021 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:30,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:50:30,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:30,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2080516460, now seen corresponding path program 1 times [2025-01-09 12:50:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684237909] [2025-01-09 12:50:30,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:30,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 12:50:30,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 12:50:30,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:30,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:30,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:30,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684237909] [2025-01-09 12:50:30,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684237909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:30,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:30,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:50:30,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909015180] [2025-01-09 12:50:30,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:30,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:50:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:30,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:50:30,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:50:30,451 INFO L87 Difference]: Start difference. First operand 304 states and 476 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:30,664 INFO L93 Difference]: Finished difference Result 750 states and 1169 transitions. [2025-01-09 12:50:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:50:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-01-09 12:50:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:30,667 INFO L225 Difference]: With dead ends: 750 [2025-01-09 12:50:30,668 INFO L226 Difference]: Without dead ends: 449 [2025-01-09 12:50:30,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:30,669 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 120 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:30,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 404 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:50:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-01-09 12:50:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 411. [2025-01-09 12:50:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 282 states have (on average 1.4113475177304964) internal successors, (398), 282 states have internal predecessors, (398), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 12:50:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 646 transitions. [2025-01-09 12:50:30,722 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 646 transitions. Word has length 200 [2025-01-09 12:50:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:30,724 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 646 transitions. [2025-01-09 12:50:30,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 646 transitions. [2025-01-09 12:50:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 12:50:30,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:30,726 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:30,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:50:30,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:30,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1551605366, now seen corresponding path program 1 times [2025-01-09 12:50:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244492156] [2025-01-09 12:50:30,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:30,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 12:50:30,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 12:50:30,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:30,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244492156] [2025-01-09 12:50:30,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244492156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:30,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:30,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:50:30,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156460389] [2025-01-09 12:50:30,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:30,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:50:30,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:30,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:50:30,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:50:30,957 INFO L87 Difference]: Start difference. First operand 411 states and 646 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:31,235 INFO L93 Difference]: Finished difference Result 817 states and 1279 transitions. [2025-01-09 12:50:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:50:31,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 12:50:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:31,238 INFO L225 Difference]: With dead ends: 817 [2025-01-09 12:50:31,238 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 12:50:31,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:50:31,240 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 177 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:31,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 643 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:50:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 12:50:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 410. [2025-01-09 12:50:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 281 states have (on average 1.405693950177936) internal successors, (395), 281 states have internal predecessors, (395), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 12:50:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 643 transitions. [2025-01-09 12:50:31,280 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 643 transitions. Word has length 204 [2025-01-09 12:50:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:31,281 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 643 transitions. [2025-01-09 12:50:31,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 643 transitions. [2025-01-09 12:50:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 12:50:31,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:31,285 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:31,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:50:31,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:31,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1411056756, now seen corresponding path program 1 times [2025-01-09 12:50:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443035843] [2025-01-09 12:50:31,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:31,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 12:50:31,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 12:50:31,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:31,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:31,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:31,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443035843] [2025-01-09 12:50:31,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443035843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:31,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:31,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:50:31,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176124864] [2025-01-09 12:50:31,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:31,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:50:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:31,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:50:31,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:50:31,587 INFO L87 Difference]: Start difference. First operand 410 states and 643 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:31,778 INFO L93 Difference]: Finished difference Result 1054 states and 1655 transitions. [2025-01-09 12:50:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:50:31,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 12:50:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:31,785 INFO L225 Difference]: With dead ends: 1054 [2025-01-09 12:50:31,785 INFO L226 Difference]: Without dead ends: 734 [2025-01-09 12:50:31,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:31,787 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 82 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:31,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 339 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:50:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-01-09 12:50:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 728. [2025-01-09 12:50:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 503 states have (on average 1.3976143141153081) internal successors, (703), 503 states have internal predecessors, (703), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2025-01-09 12:50:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1137 transitions. [2025-01-09 12:50:31,861 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1137 transitions. Word has length 204 [2025-01-09 12:50:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:31,862 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1137 transitions. [2025-01-09 12:50:31,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1137 transitions. [2025-01-09 12:50:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 12:50:31,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:31,865 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:50:31,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:31,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1872793290, now seen corresponding path program 1 times [2025-01-09 12:50:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235824110] [2025-01-09 12:50:31,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:31,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 12:50:31,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 12:50:31,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:31,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:32,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:32,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235824110] [2025-01-09 12:50:32,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235824110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:32,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:50:32,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866281407] [2025-01-09 12:50:32,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:32,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:50:32,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:32,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:50:32,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:32,261 INFO L87 Difference]: Start difference. First operand 728 states and 1137 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:32,521 INFO L93 Difference]: Finished difference Result 1780 states and 2779 transitions. [2025-01-09 12:50:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:50:32,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 12:50:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:32,530 INFO L225 Difference]: With dead ends: 1780 [2025-01-09 12:50:32,530 INFO L226 Difference]: Without dead ends: 1162 [2025-01-09 12:50:32,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:50:32,533 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 221 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:32,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 527 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:50:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-01-09 12:50:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 956. [2025-01-09 12:50:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 667 states have (on average 1.406296851574213) internal successors, (938), 667 states have internal predecessors, (938), 279 states have call successors, (279), 9 states have call predecessors, (279), 9 states have return successors, (279), 279 states have call predecessors, (279), 279 states have call successors, (279) [2025-01-09 12:50:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1496 transitions. [2025-01-09 12:50:32,648 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1496 transitions. Word has length 204 [2025-01-09 12:50:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:32,648 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1496 transitions. [2025-01-09 12:50:32,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1496 transitions. [2025-01-09 12:50:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:50:32,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:32,651 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:50:32,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:32,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash -529787386, now seen corresponding path program 1 times [2025-01-09 12:50:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462653404] [2025-01-09 12:50:32,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:32,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:32,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:32,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:32,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:32,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:32,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:32,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462653404] [2025-01-09 12:50:32,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462653404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:32,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:50:32,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301214774] [2025-01-09 12:50:32,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:32,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:50:32,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:32,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:50:32,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:50:32,718 INFO L87 Difference]: Start difference. First operand 956 states and 1496 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:32,804 INFO L93 Difference]: Finished difference Result 2201 states and 3426 transitions. [2025-01-09 12:50:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:50:32,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 12:50:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:32,812 INFO L225 Difference]: With dead ends: 2201 [2025-01-09 12:50:32,812 INFO L226 Difference]: Without dead ends: 1325 [2025-01-09 12:50:32,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:50:32,816 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 40 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:32,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 290 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:50:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-01-09 12:50:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1182. [2025-01-09 12:50:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 893 states have (on average 1.4266517357222845) internal successors, (1274), 893 states have internal predecessors, (1274), 279 states have call successors, (279), 9 states have call predecessors, (279), 9 states have return successors, (279), 279 states have call predecessors, (279), 279 states have call successors, (279) [2025-01-09 12:50:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1832 transitions. [2025-01-09 12:50:32,900 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1832 transitions. Word has length 205 [2025-01-09 12:50:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:32,900 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1832 transitions. [2025-01-09 12:50:32,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1832 transitions. [2025-01-09 12:50:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:50:32,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:32,902 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:32,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:50:32,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:32,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1550855740, now seen corresponding path program 1 times [2025-01-09 12:50:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888515828] [2025-01-09 12:50:32,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:32,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:33,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:33,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:33,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:50:33,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205700700] [2025-01-09 12:50:33,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:33,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:33,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:33,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:50:33,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:50:33,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:33,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:33,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:33,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:33,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 12:50:33,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1493 proven. 159 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-01-09 12:50:37,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:50:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888515828] [2025-01-09 12:50:49,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:50:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205700700] [2025-01-09 12:50:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205700700] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:49,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:50:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2025-01-09 12:50:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722347921] [2025-01-09 12:50:49,544 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 12:50:49,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 12:50:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:49,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 12:50:49,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=2456, Unknown=1, NotChecked=0, Total=2970 [2025-01-09 12:50:49,546 INFO L87 Difference]: Start difference. First operand 1182 states and 1832 transitions. Second operand has 44 states, 44 states have (on average 2.227272727272727) internal successors, (98), 39 states have internal predecessors, (98), 11 states have call successors, (31), 11 states have call predecessors, (31), 16 states have return successors, (31), 12 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-09 12:50:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:52,483 INFO L93 Difference]: Finished difference Result 2138 states and 3169 transitions. [2025-01-09 12:50:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 12:50:52,484 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.227272727272727) internal successors, (98), 39 states have internal predecessors, (98), 11 states have call successors, (31), 11 states have call predecessors, (31), 16 states have return successors, (31), 12 states have call predecessors, (31), 11 states have call successors, (31) Word has length 205 [2025-01-09 12:50:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:52,496 INFO L225 Difference]: With dead ends: 2138 [2025-01-09 12:50:52,497 INFO L226 Difference]: Without dead ends: 1876 [2025-01-09 12:50:52,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2753 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1805, Invalid=8496, Unknown=1, NotChecked=0, Total=10302 [2025-01-09 12:50:52,502 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 844 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:52,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1605 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:50:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2025-01-09 12:50:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1690. [2025-01-09 12:50:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1267 states have (on average 1.3796369376479873) internal successors, (1748), 1276 states have internal predecessors, (1748), 390 states have call successors, (390), 32 states have call predecessors, (390), 32 states have return successors, (390), 381 states have call predecessors, (390), 390 states have call successors, (390) [2025-01-09 12:50:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2528 transitions. [2025-01-09 12:50:52,643 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2528 transitions. Word has length 205 [2025-01-09 12:50:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:52,643 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2528 transitions. [2025-01-09 12:50:52,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.227272727272727) internal successors, (98), 39 states have internal predecessors, (98), 11 states have call successors, (31), 11 states have call predecessors, (31), 16 states have return successors, (31), 12 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-09 12:50:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2528 transitions. [2025-01-09 12:50:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:50:52,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:52,647 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:52,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:50:52,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:52,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:52,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1732994306, now seen corresponding path program 1 times [2025-01-09 12:50:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080870517] [2025-01-09 12:50:52,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:52,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:53,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:53,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:53,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 429 proven. 75 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-01-09 12:50:54,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080870517] [2025-01-09 12:50:54,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080870517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298647131] [2025-01-09 12:50:54,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:54,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:54,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:54,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:50:54,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:50:54,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:54,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:54,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 12:50:54,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1184 proven. 126 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-01-09 12:50:55,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:50:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298647131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:56,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:50:56,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28] total 39 [2025-01-09 12:50:56,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011921971] [2025-01-09 12:50:56,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:50:56,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 12:50:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:56,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 12:50:56,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1768, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 12:50:56,382 INFO L87 Difference]: Start difference. First operand 1690 states and 2528 transitions. Second operand has 39 states, 37 states have (on average 3.027027027027027) internal successors, (112), 33 states have internal predecessors, (112), 13 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 15 states have call predecessors, (62), 13 states have call successors, (62) [2025-01-09 12:50:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:58,858 INFO L93 Difference]: Finished difference Result 3443 states and 4878 transitions. [2025-01-09 12:50:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-01-09 12:50:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 3.027027027027027) internal successors, (112), 33 states have internal predecessors, (112), 13 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 15 states have call predecessors, (62), 13 states have call successors, (62) Word has length 205 [2025-01-09 12:50:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:58,873 INFO L225 Difference]: With dead ends: 3443 [2025-01-09 12:50:58,873 INFO L226 Difference]: Without dead ends: 2959 [2025-01-09 12:50:58,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2408 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1833, Invalid=7287, Unknown=0, NotChecked=0, Total=9120 [2025-01-09 12:50:58,878 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 752 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:58,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 2062 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:50:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-01-09 12:50:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2804. [2025-01-09 12:50:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2084 states have (on average 1.3320537428023032) internal successors, (2776), 2096 states have internal predecessors, (2776), 596 states have call successors, (596), 123 states have call predecessors, (596), 123 states have return successors, (596), 584 states have call predecessors, (596), 596 states have call successors, (596) [2025-01-09 12:50:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3968 transitions. [2025-01-09 12:50:59,074 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3968 transitions. Word has length 205 [2025-01-09 12:50:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:59,075 INFO L471 AbstractCegarLoop]: Abstraction has 2804 states and 3968 transitions. [2025-01-09 12:50:59,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 3.027027027027027) internal successors, (112), 33 states have internal predecessors, (112), 13 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 15 states have call predecessors, (62), 13 states have call successors, (62) [2025-01-09 12:50:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3968 transitions. [2025-01-09 12:50:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:50:59,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:59,077 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:59,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 12:50:59,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:59,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:59,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1417646187, now seen corresponding path program 1 times [2025-01-09 12:50:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768482472] [2025-01-09 12:50:59,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:59,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:59,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:59,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:59,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:59,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768482472] [2025-01-09 12:50:59,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768482472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:59,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:59,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:50:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564517879] [2025-01-09 12:50:59,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:59,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:50:59,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:59,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:50:59,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:50:59,464 INFO L87 Difference]: Start difference. First operand 2804 states and 3968 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:59,629 INFO L93 Difference]: Finished difference Result 6050 states and 8611 transitions. [2025-01-09 12:50:59,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:50:59,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 12:50:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:59,646 INFO L225 Difference]: With dead ends: 6050 [2025-01-09 12:50:59,646 INFO L226 Difference]: Without dead ends: 3578 [2025-01-09 12:50:59,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:59,653 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 92 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:59,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 483 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:50:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-01-09 12:50:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 2885. [2025-01-09 12:50:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2165 states have (on average 1.3200923787528869) internal successors, (2858), 2177 states have internal predecessors, (2858), 596 states have call successors, (596), 123 states have call predecessors, (596), 123 states have return successors, (596), 584 states have call predecessors, (596), 596 states have call successors, (596) [2025-01-09 12:50:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4050 transitions. [2025-01-09 12:50:59,838 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4050 transitions. Word has length 205 [2025-01-09 12:50:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:59,838 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4050 transitions. [2025-01-09 12:50:59,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4050 transitions. [2025-01-09 12:50:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:50:59,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:59,841 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:59,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:50:59,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:59,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1188377367, now seen corresponding path program 1 times [2025-01-09 12:50:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113049480] [2025-01-09 12:50:59,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:59,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:59,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:59,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:59,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 12:51:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:00,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113049480] [2025-01-09 12:51:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113049480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:51:00,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185413774] [2025-01-09 12:51:00,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:00,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:51:00,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:51:00,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:51:00,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 12:51:00,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:51:00,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:51:00,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:00,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:00,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 12:51:00,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1251 proven. 108 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-01-09 12:51:01,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:51:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 81 proven. 96 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-01-09 12:51:03,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185413774] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:51:03,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:51:03,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 39 [2025-01-09 12:51:03,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752886342] [2025-01-09 12:51:03,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:51:03,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 12:51:03,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:03,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 12:51:03,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1160, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 12:51:03,442 INFO L87 Difference]: Start difference. First operand 2885 states and 4050 transitions. Second operand has 39 states, 38 states have (on average 4.131578947368421) internal successors, (157), 39 states have internal predecessors, (157), 11 states have call successors, (93), 5 states have call predecessors, (93), 11 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) [2025-01-09 12:51:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:06,975 INFO L93 Difference]: Finished difference Result 9664 states and 13460 transitions. [2025-01-09 12:51:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-09 12:51:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.131578947368421) internal successors, (157), 39 states have internal predecessors, (157), 11 states have call successors, (93), 5 states have call predecessors, (93), 11 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) Word has length 205 [2025-01-09 12:51:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:07,006 INFO L225 Difference]: With dead ends: 9664 [2025-01-09 12:51:07,006 INFO L226 Difference]: Without dead ends: 7333 [2025-01-09 12:51:07,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2182, Invalid=6560, Unknown=0, NotChecked=0, Total=8742 [2025-01-09 12:51:07,015 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 1371 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:07,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 1852 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 12:51:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7333 states. [2025-01-09 12:51:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7333 to 4993. [2025-01-09 12:51:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 3669 states have (on average 1.3107113654946851) internal successors, (4809), 3703 states have internal predecessors, (4809), 1084 states have call successors, (1084), 239 states have call predecessors, (1084), 239 states have return successors, (1084), 1050 states have call predecessors, (1084), 1084 states have call successors, (1084) [2025-01-09 12:51:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 6977 transitions. [2025-01-09 12:51:07,461 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 6977 transitions. Word has length 205 [2025-01-09 12:51:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:07,462 INFO L471 AbstractCegarLoop]: Abstraction has 4993 states and 6977 transitions. [2025-01-09 12:51:07,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.131578947368421) internal successors, (157), 39 states have internal predecessors, (157), 11 states have call successors, (93), 5 states have call predecessors, (93), 11 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) [2025-01-09 12:51:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 6977 transitions. [2025-01-09 12:51:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 12:51:07,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:07,469 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:07,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 12:51:07,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 12:51:07,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:07,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1373694606, now seen corresponding path program 1 times [2025-01-09 12:51:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861705695] [2025-01-09 12:51:07,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:07,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:51:07,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:51:07,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:07,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:51:07,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1661715259] [2025-01-09 12:51:07,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:07,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:51:07,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:51:07,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:51:07,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 12:51:07,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:51:07,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:51:07,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:07,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:51:07,931 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:51:07,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:51:08,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:51:08,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:08,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:51:08,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:51:08,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:51:08,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:51:08,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 12:51:08,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 12:51:08,387 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:08,573 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:51:08,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:51:08 BoogieIcfgContainer [2025-01-09 12:51:08,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:51:08,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:51:08,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:51:08,577 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:51:08,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:27" (3/4) ... [2025-01-09 12:51:08,579 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:51:08,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:51:08,580 INFO L158 Benchmark]: Toolchain (without parser) took 41836.18ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 106.2MB in the beginning and 171.1MB in the end (delta: -64.9MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-01-09 12:51:08,581 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:51:08,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.03ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 88.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:51:08,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.90ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:51:08,581 INFO L158 Benchmark]: Boogie Preprocessor took 60.08ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 73.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:51:08,581 INFO L158 Benchmark]: RCFGBuilder took 543.57ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 37.8MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 12:51:08,581 INFO L158 Benchmark]: TraceAbstraction took 40952.51ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 37.8MB in the beginning and 171.2MB in the end (delta: -133.5MB). Peak memory consumption was 368.6MB. Max. memory is 16.1GB. [2025-01-09 12:51:08,581 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 251.7MB. Free memory was 171.2MB in the beginning and 171.1MB in the end (delta: 93.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:51:08,582 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.03ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 88.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.90ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.08ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 73.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 543.57ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 37.8MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40952.51ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 37.8MB in the beginning and 171.2MB in the end (delta: -133.5MB). Peak memory consumption was 368.6MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 251.7MB. Free memory was 171.2MB in the beginning and 171.1MB in the end (delta: 93.8kB). 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 204, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of bitwiseOr at line 204, overapproximation of bitwiseOr at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed short int var_1_6 = -1; [L24] unsigned char var_1_7 = 1; [L25] unsigned char var_1_8 = 1; [L26] signed char var_1_9 = -128; [L27] signed char var_1_12 = 10; [L28] signed char var_1_13 = -64; [L29] signed char var_1_14 = 1; [L30] signed char var_1_15 = -25; [L31] unsigned short int var_1_16 = 256; [L32] signed char var_1_18 = 4; [L33] float var_1_19 = 100.5; [L34] float var_1_20 = 4.5; [L35] signed char var_1_21 = 0; [L36] signed char var_1_22 = 64; [L37] signed char var_1_23 = 2; [L38] signed char var_1_24 = 4; [L39] unsigned long int var_1_25 = 8; [L40] unsigned char var_1_27 = 50; [L41] unsigned char var_1_28 = 5; [L42] signed short int var_1_29 = 32; [L43] signed long int var_1_30 = 1; [L44] signed long int var_1_31 = 0; [L45] unsigned char var_1_33 = 2; [L46] unsigned char var_1_34 = 128; [L47] unsigned char var_1_35 = 2; [L48] unsigned char var_1_36 = 200; [L49] unsigned char var_1_37 = 32; [L50] double var_1_38 = 10.3; [L51] signed short int var_1_39 = -256; [L52] signed short int last_1_var_1_6 = -1; [L53] signed char last_1_var_1_9 = -128; [L54] unsigned short int last_1_var_1_16 = 256; [L55] signed char last_1_var_1_18 = 4; [L56] float last_1_var_1_19 = 100.5; [L57] unsigned long int last_1_var_1_25 = 8; [L58] unsigned char last_1_var_1_27 = 50; [L59] signed short int last_1_var_1_29 = 32; [L60] unsigned char last_1_var_1_33 = 2; [L61] unsigned char last_1_var_1_35 = 2; VAL [isInitial=0, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L208] isInitial = 1 [L209] FCALL initially() [L210] int k_loop; [L211] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L211] COND TRUE k_loop < 1 [L212] CALL updateLastVariables() [L192] last_1_var_1_6 = var_1_6 [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_16 = var_1_16 [L195] last_1_var_1_18 = var_1_18 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_25 = var_1_25 [L198] last_1_var_1_27 = var_1_27 [L199] last_1_var_1_29 = var_1_29 [L200] last_1_var_1_33 = var_1_33 [L201] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L212] RET updateLastVariables() [L213] CALL updateVariables() [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L149] var_1_12 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L150] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L151] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L151] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L152] var_1_13 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L153] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L154] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L154] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L155] var_1_14 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L156] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L157] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L157] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L159] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L160] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L160] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L161] var_1_20 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L162] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L163] var_1_22 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L164] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L165] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L165] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L166] var_1_23 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L168] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L168] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L169] var_1_24 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L171] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L171] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L172] var_1_28 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L173] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L174] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L174] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L175] var_1_30 = __VERIFIER_nondet_long() [L176] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L176] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L177] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L177] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L178] var_1_31 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L179] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L181] var_1_34 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_34 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L182] RET assume_abort_if_not(var_1_34 >= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L183] CALL assume_abort_if_not(var_1_34 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L183] RET assume_abort_if_not(var_1_34 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L184] var_1_36 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_36 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L185] RET assume_abort_if_not(var_1_36 >= 190) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L186] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L186] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L187] var_1_37 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_37 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L188] RET assume_abort_if_not(var_1_37 >= 31) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L189] CALL assume_abort_if_not(var_1_37 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L189] RET assume_abort_if_not(var_1_37 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L213] RET updateVariables() [L214] CALL step() [L65] signed long int stepLocal_0 = 50 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L66] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L66] COND FALSE !((last_1_var_1_16 | last_1_var_1_9) >= stepLocal_0) [L69] COND FALSE !((last_1_var_1_19 + last_1_var_1_19) > 200.875f) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L76] signed long int stepLocal_4 = last_1_var_1_9; [L77] signed long int stepLocal_3 = var_1_24 % var_1_34; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=61, stepLocal_4=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L78] COND FALSE !(last_1_var_1_16 <= stepLocal_4) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=61, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L81] COND TRUE stepLocal_3 >= last_1_var_1_27 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L82] COND FALSE !(\read(var_1_7)) [L85] var_1_33 = var_1_28 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L89] var_1_19 = var_1_20 [L90] var_1_21 = ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24))))) [L91] var_1_27 = ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28) [L92] var_1_38 = var_1_20 [L93] var_1_39 = 128 [L94] unsigned char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=8, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L95] COND FALSE !(var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) [L100] var_1_25 = 2u VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L102] COND FALSE !(\read(var_1_7)) [L109] var_1_16 = var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L111] signed long int stepLocal_5 = var_1_30 + var_1_39; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, stepLocal_5=128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L112] COND TRUE (var_1_25 - last_1_var_1_35) <= stepLocal_5 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L113] COND FALSE !(\read(var_1_7)) [L116] var_1_35 = ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L119] unsigned short int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_1=32, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L120] COND TRUE stepLocal_1 <= var_1_35 [L121] var_1_18 = (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L125] EXPR var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L125] COND FALSE !((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) [L130] var_1_29 = (var_1_28 - var_1_30) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L132] COND TRUE var_1_21 > var_1_29 [L133] var_1_6 = (var_1_21 - last_1_var_1_6) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128] [L214] RET step() [L215] CALL, EXPR property() [L204] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128] [L204] EXPR (((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128] [L204-L205] return (((((((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30))))) && ((last_1_var_1_16 <= last_1_var_1_9) ? (var_1_33 == ((unsigned char) (var_1_34 - var_1_28))) : (((var_1_24 % var_1_34) >= last_1_var_1_27) ? (var_1_7 ? (var_1_33 == ((unsigned char) (((((((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) > ((64 - var_1_30))) ? (((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) : ((64 - var_1_30)))) + 1))) : (var_1_33 == ((unsigned char) var_1_28))) : 1))) && (((var_1_25 - last_1_var_1_35) <= (var_1_30 + var_1_39)) ? (var_1_7 ? (var_1_35 == ((unsigned char) var_1_28)) : (var_1_35 == ((unsigned char) ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24))))))) : 1)) && (var_1_38 == ((double) var_1_20))) && (var_1_39 == ((signed short int) 128)) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=67, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=123, var_1_23=0, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=317, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=317, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-65217, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 13, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4116 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4082 mSDsluCounter, 9601 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7677 mSDsCounter, 1834 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7112 IncrementalHoareTripleChecker+Invalid, 8946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1834 mSolverCounterUnsat, 1924 mSDtfsCounter, 7112 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1365 GetRequests, 1043 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7382 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4993occurred in iteration=12, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 3893 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 3661 NumberOfCodeBlocks, 3661 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3233 ConstructedInterpolants, 1 QuantifiedInterpolants, 19732 SizeOfPredicates, 27 NumberOfNonLiveVariables, 2041 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 29109/29760 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:51:08,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b3751a2ceaae8972d788d7195cbb1b12ec209633513efd66a5d0e24c48ee8e17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:51:10,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:51:10,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:51:10,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:51:10,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:51:10,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:51:10,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:51:10,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:51:10,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:51:10,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:51:10,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:51:10,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:51:10,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:51:10,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:51:10,447 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:51:10,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:51:10,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:51:10,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:51:10,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:51:10,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:51:10,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:51:10,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:51:10,449 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b3751a2ceaae8972d788d7195cbb1b12ec209633513efd66a5d0e24c48ee8e17 [2025-01-09 12:51:10,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:51:10,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:51:10,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:51:10,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:51:10,712 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:51:10,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i [2025-01-09 12:51:11,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b0eb68a/3b4c8c8fa378446ca1d5aa303b1e1660/FLAGb95e3c63e [2025-01-09 12:51:12,067 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:51:12,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i [2025-01-09 12:51:12,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b0eb68a/3b4c8c8fa378446ca1d5aa303b1e1660/FLAGb95e3c63e [2025-01-09 12:51:12,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b0eb68a/3b4c8c8fa378446ca1d5aa303b1e1660 [2025-01-09 12:51:12,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:51:12,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:51:12,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:51:12,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:51:12,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:51:12,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d40cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12, skipping insertion in model container [2025-01-09 12:51:12,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:51:12,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i[916,929] [2025-01-09 12:51:12,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:51:12,653 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:51:12,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i[916,929] [2025-01-09 12:51:12,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:51:12,711 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:51:12,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12 WrapperNode [2025-01-09 12:51:12,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:51:12,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:51:12,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:51:12,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:51:12,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,753 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2025-01-09 12:51:12,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:51:12,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:51:12,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:51:12,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:51:12,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,774 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]. [2025-01-09 12:51:12,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:51:12,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:51:12,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:51:12,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:51:12,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (1/1) ... [2025-01-09 12:51:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:51:12,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:51:12,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:51:12,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:51:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:51:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:51:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:51:12,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:51:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:51:12,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:51:12,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:51:12,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:51:14,037 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 12:51:14,037 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:51:14,045 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:51:14,046 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:51:14,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:51:14 BoogieIcfgContainer [2025-01-09 12:51:14,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:51:14,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:51:14,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:51:14,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:51:14,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:51:12" (1/3) ... [2025-01-09 12:51:14,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f48b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:51:14, skipping insertion in model container [2025-01-09 12:51:14,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:51:12" (2/3) ... [2025-01-09 12:51:14,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f48b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:51:14, skipping insertion in model container [2025-01-09 12:51:14,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:51:14" (3/3) ... [2025-01-09 12:51:14,053 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-22.i [2025-01-09 12:51:14,063 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:51:14,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-22.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:51:14,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:51:14,136 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;@662701d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:51:14,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:51:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:51:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 12:51:14,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:14,147 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:14,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:14,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1674920509, now seen corresponding path program 1 times [2025-01-09 12:51:14,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:14,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642192847] [2025-01-09 12:51:14,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:14,159 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 [2025-01-09 12:51:14,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:14,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:14,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 12:51:14,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 12:51:14,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 12:51:14,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:14,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:14,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:51:14,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2025-01-09 12:51:14,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:51:14,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642192847] [2025-01-09 12:51:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642192847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:14,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:51:14,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200850035] [2025-01-09 12:51:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:14,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:51:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:14,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:51:14,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:51:14,434 INFO L87 Difference]: Start difference. First operand has 86 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:51:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:14,452 INFO L93 Difference]: Finished difference Result 169 states and 298 transitions. [2025-01-09 12:51:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:51:14,454 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 193 [2025-01-09 12:51:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:14,461 INFO L225 Difference]: With dead ends: 169 [2025-01-09 12:51:14,461 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 12:51:14,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:51:14,467 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:14,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:51:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 12:51:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 12:51:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:51:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2025-01-09 12:51:14,503 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 193 [2025-01-09 12:51:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:14,503 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2025-01-09 12:51:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:51:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2025-01-09 12:51:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 12:51:14,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:14,507 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:14,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 12:51:14,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:51:14,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:14,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1875672773, now seen corresponding path program 1 times [2025-01-09 12:51:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:14,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61026030] [2025-01-09 12:51:14,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:14,710 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 [2025-01-09 12:51:14,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:14,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:14,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 12:51:14,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 12:51:14,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 12:51:14,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:14,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:14,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:51:14,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:16,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:51:16,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:16,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61026030] [2025-01-09 12:51:16,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61026030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:16,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:16,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:51:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036147425] [2025-01-09 12:51:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:16,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:51:16,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:16,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:51:16,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:51:16,173 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:17,795 INFO L93 Difference]: Finished difference Result 268 states and 423 transitions. [2025-01-09 12:51:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:51:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2025-01-09 12:51:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:17,811 INFO L225 Difference]: With dead ends: 268 [2025-01-09 12:51:17,811 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 12:51:17,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:51:17,812 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 134 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:17,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 436 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 12:51:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 12:51:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 160. [2025-01-09 12:51:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 12:51:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 253 transitions. [2025-01-09 12:51:17,843 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 253 transitions. Word has length 193 [2025-01-09 12:51:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:17,843 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 253 transitions. [2025-01-09 12:51:17,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 253 transitions. [2025-01-09 12:51:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 12:51:17,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:17,845 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:17,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 12:51:18,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:51:18,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:18,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash 830946621, now seen corresponding path program 1 times [2025-01-09 12:51:18,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:18,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579616333] [2025-01-09 12:51:18,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:18,051 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 [2025-01-09 12:51:18,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:18,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:18,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 12:51:18,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 12:51:18,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 12:51:18,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:18,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:18,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:51:18,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:19,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:51:19,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579616333] [2025-01-09 12:51:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579616333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:51:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426879594] [2025-01-09 12:51:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:19,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:51:19,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:19,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:51:19,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:51:19,438 INFO L87 Difference]: Start difference. First operand 160 states and 253 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:21,177 INFO L93 Difference]: Finished difference Result 321 states and 507 transitions. [2025-01-09 12:51:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:51:21,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2025-01-09 12:51:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:21,192 INFO L225 Difference]: With dead ends: 321 [2025-01-09 12:51:21,192 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 12:51:21,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:51:21,194 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 75 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:21,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 361 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 12:51:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 12:51:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2025-01-09 12:51:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 12:51:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 215 transitions. [2025-01-09 12:51:21,212 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 215 transitions. Word has length 193 [2025-01-09 12:51:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:21,213 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 215 transitions. [2025-01-09 12:51:21,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 215 transitions. [2025-01-09 12:51:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 12:51:21,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:21,215 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:21,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 12:51:21,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:51:21,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1954956433, now seen corresponding path program 1 times [2025-01-09 12:51:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765710130] [2025-01-09 12:51:21,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:21,420 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 [2025-01-09 12:51:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:21,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:21,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 12:51:21,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 12:51:21,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 12:51:21,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:21,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:21,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:51:21,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:21,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:51:21,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765710130] [2025-01-09 12:51:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765710130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:21,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:21,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:51:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997895205] [2025-01-09 12:51:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:21,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:51:21,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:21,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:51:21,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:51:21,967 INFO L87 Difference]: Start difference. First operand 138 states and 215 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:23,571 INFO L93 Difference]: Finished difference Result 244 states and 383 transitions. [2025-01-09 12:51:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:51:23,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2025-01-09 12:51:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:23,584 INFO L225 Difference]: With dead ends: 244 [2025-01-09 12:51:23,584 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 12:51:23,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:51:23,585 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:23,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 490 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:51:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 12:51:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2025-01-09 12:51:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 12:51:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 219 transitions. [2025-01-09 12:51:23,604 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 219 transitions. Word has length 194 [2025-01-09 12:51:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:23,604 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 219 transitions. [2025-01-09 12:51:23,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 219 transitions. [2025-01-09 12:51:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 12:51:23,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:23,606 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:23,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 12:51:23,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:51:23,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:23,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2067822902, now seen corresponding path program 1 times [2025-01-09 12:51:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510295054] [2025-01-09 12:51:23,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:23,808 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 [2025-01-09 12:51:23,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:23,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:23,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 12:51:23,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 12:51:23,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 12:51:23,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:23,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:23,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:51:23,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:24,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:51:24,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510295054] [2025-01-09 12:51:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510295054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:24,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:51:24,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928547619] [2025-01-09 12:51:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:51:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:24,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:51:24,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:51:24,215 INFO L87 Difference]: Start difference. First operand 141 states and 219 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:25,513 INFO L93 Difference]: Finished difference Result 332 states and 518 transitions. [2025-01-09 12:51:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:51:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2025-01-09 12:51:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:25,526 INFO L225 Difference]: With dead ends: 332 [2025-01-09 12:51:25,526 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 12:51:25,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:51:25,527 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 147 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:25,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 431 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:51:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 12:51:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 222. [2025-01-09 12:51:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 125 states have (on average 1.304) internal successors, (163), 125 states have internal predecessors, (163), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:51:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 349 transitions. [2025-01-09 12:51:25,551 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 349 transitions. Word has length 195 [2025-01-09 12:51:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:25,551 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 349 transitions. [2025-01-09 12:51:25,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 349 transitions. [2025-01-09 12:51:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 12:51:25,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:25,553 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:25,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 12:51:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:51:25,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 14839957, now seen corresponding path program 1 times [2025-01-09 12:51:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906973924] [2025-01-09 12:51:25,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:25,754 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 [2025-01-09 12:51:25,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:25,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:25,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 12:51:25,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 12:51:25,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 12:51:25,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:25,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:25,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:51:25,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 148 proven. 87 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2025-01-09 12:51:26,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:51:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:26,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906973924] [2025-01-09 12:51:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906973924] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 12:51:26,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:51:26,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 12:51:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775687964] [2025-01-09 12:51:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:26,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:51:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:26,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:51:26,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:51:26,389 INFO L87 Difference]: Start difference. First operand 222 states and 349 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:27,494 INFO L93 Difference]: Finished difference Result 436 states and 688 transitions. [2025-01-09 12:51:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:51:27,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-01-09 12:51:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:27,496 INFO L225 Difference]: With dead ends: 436 [2025-01-09 12:51:27,497 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 12:51:27,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:51:27,498 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 59 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:27,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 275 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 12:51:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 12:51:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 238. [2025-01-09 12:51:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:51:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 371 transitions. [2025-01-09 12:51:27,532 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 371 transitions. Word has length 196 [2025-01-09 12:51:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:27,532 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 371 transitions. [2025-01-09 12:51:27,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 371 transitions. [2025-01-09 12:51:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 12:51:27,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:27,534 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:27,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 12:51:27,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:51:27,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 273005395, now seen corresponding path program 1 times [2025-01-09 12:51:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061680089] [2025-01-09 12:51:27,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:27,736 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 [2025-01-09 12:51:27,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:27,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:27,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 12:51:27,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 12:51:27,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 12:51:27,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:27,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:27,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 12:51:27,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 839 proven. 48 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-01-09 12:51:29,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:51:29,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061680089] [2025-01-09 12:51:29,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061680089] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:51:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1512262609] [2025-01-09 12:51:29,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:29,520 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:51:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:51:29,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:51:29,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-01-09 12:51:29,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 12:51:30,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 12:51:30,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:30,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:30,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:51:30,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:30,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:51:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1512262609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:30,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:51:30,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2025-01-09 12:51:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251035331] [2025-01-09 12:51:30,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:30,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:51:30,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:30,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:51:30,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:51:30,635 INFO L87 Difference]: Start difference. First operand 238 states and 371 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:31,062 INFO L93 Difference]: Finished difference Result 509 states and 796 transitions. [2025-01-09 12:51:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:51:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-01-09 12:51:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:31,065 INFO L225 Difference]: With dead ends: 509 [2025-01-09 12:51:31,065 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 12:51:31,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:51:31,066 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 28 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:31,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 293 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:51:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 12:51:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 321. [2025-01-09 12:51:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 192 states have (on average 1.328125) internal successors, (255), 192 states have internal predecessors, (255), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 12:51:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 503 transitions. [2025-01-09 12:51:31,094 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 503 transitions. Word has length 196 [2025-01-09 12:51:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:31,095 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 503 transitions. [2025-01-09 12:51:31,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 503 transitions. [2025-01-09 12:51:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 12:51:31,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:31,096 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:31,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 12:51:31,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-01-09 12:51:31,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 12:51:31,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:31,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2048012757, now seen corresponding path program 1 times [2025-01-09 12:51:31,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:31,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510330558] [2025-01-09 12:51:31,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:31,501 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 [2025-01-09 12:51:31,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:31,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:31,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 12:51:31,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 12:51:31,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 12:51:31,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:31,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:31,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 12:51:31,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 839 proven. 48 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-01-09 12:51:32,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:51:32,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:32,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510330558] [2025-01-09 12:51:32,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510330558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:51:32,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1548903832] [2025-01-09 12:51:32,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:32,768 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:51:32,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:51:32,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:51:32,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-01-09 12:51:32,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 12:51:33,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 12:51:33,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:33,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:33,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 12:51:33,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 828 proven. 27 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2025-01-09 12:51:33,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:51:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1548903832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:51:33,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:51:33,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2025-01-09 12:51:33,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272014937] [2025-01-09 12:51:33,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:51:33,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:51:33,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:33,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:51:33,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:51:33,943 INFO L87 Difference]: Start difference. First operand 321 states and 503 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2025-01-09 12:51:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:34,999 INFO L93 Difference]: Finished difference Result 621 states and 968 transitions. [2025-01-09 12:51:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:51:35,001 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 196 [2025-01-09 12:51:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:35,004 INFO L225 Difference]: With dead ends: 621 [2025-01-09 12:51:35,004 INFO L226 Difference]: Without dead ends: 361 [2025-01-09 12:51:35,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=765, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 12:51:35,006 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 164 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:35,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 640 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:51:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-09 12:51:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 337. [2025-01-09 12:51:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 124 states have call successors, (124), 6 states have call predecessors, (124), 6 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 12:51:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 523 transitions. [2025-01-09 12:51:35,039 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 523 transitions. Word has length 196 [2025-01-09 12:51:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:35,041 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 523 transitions. [2025-01-09 12:51:35,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2025-01-09 12:51:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 523 transitions. [2025-01-09 12:51:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 12:51:35,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:35,043 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:51:35,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2025-01-09 12:51:35,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-01-09 12:51:35,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:51:35,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:35,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1100942280, now seen corresponding path program 1 times [2025-01-09 12:51:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439821374] [2025-01-09 12:51:35,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:35,445 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 [2025-01-09 12:51:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:35,446 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:51:35,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 12:51:35,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 12:51:35,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 12:51:35,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:35,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:35,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:51:35,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 918 proven. 54 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2025-01-09 12:51:38,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:51:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 12:51:45,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:45,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439821374] [2025-01-09 12:51:45,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439821374] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:51:45,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:51:45,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 12:51:45,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146182721] [2025-01-09 12:51:45,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:51:45,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:51:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:45,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:51:45,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:51:45,384 INFO L87 Difference]: Start difference. First operand 337 states and 523 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 3 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50)