./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eeb4616c82dd418b721c618c54512d08e3a8ea8d5c6a2fdf9225b3e79e147c74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:17:39,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:17:39,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:17:39,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:17:39,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:17:39,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:17:39,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:17:39,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:17:39,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:17:39,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:17:39,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:17:39,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:17:39,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:17:39,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:17:39,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:17:39,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:17:39,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:17:39,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:17:39,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:17:39,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:17:39,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:17:39,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:17:39,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:17:39,778 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/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 -> eeb4616c82dd418b721c618c54512d08e3a8ea8d5c6a2fdf9225b3e79e147c74 [2025-03-17 03:17:40,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:17:40,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:17:40,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:17:40,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:17:40,015 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:17:40,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i [2025-03-17 03:17:41,198 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20f9f854/3509d2cb3b6a448bb444a701a2a98920/FLAGb681b2f1a [2025-03-17 03:17:41,543 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:17:41,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i [2025-03-17 03:17:41,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20f9f854/3509d2cb3b6a448bb444a701a2a98920/FLAGb681b2f1a [2025-03-17 03:17:41,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20f9f854/3509d2cb3b6a448bb444a701a2a98920 [2025-03-17 03:17:41,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:17:41,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:17:41,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:17:41,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:17:41,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:17:41,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41, skipping insertion in model container [2025-03-17 03:17:41,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:17:41,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i[916,929] [2025-03-17 03:17:41,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:17:41,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:17:41,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i[916,929] [2025-03-17 03:17:41,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:17:41,826 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:17:41,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41 WrapperNode [2025-03-17 03:17:41,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:17:41,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:17:41,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:17:41,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:17:41,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,864 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-17 03:17:41,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:17:41,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:17:41,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:17:41,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:17:41,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,885 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-03-17 03:17:41,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,895 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:17:41,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:17:41,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:17:41,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:17:41,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (1/1) ... [2025-03-17 03:17:41,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:17:41,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:41,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:17:41,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:17:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:17:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:17:41,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:17:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:17:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:17:41,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:17:42,018 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:17:42,020 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:17:42,381 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 03:17:42,383 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:17:42,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:17:42,394 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:17:42,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:42 BoogieIcfgContainer [2025-03-17 03:17:42,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:17:42,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:17:42,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:17:42,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:17:42,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:17:41" (1/3) ... [2025-03-17 03:17:42,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21171499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:17:42, skipping insertion in model container [2025-03-17 03:17:42,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:41" (2/3) ... [2025-03-17 03:17:42,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21171499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:17:42, skipping insertion in model container [2025-03-17 03:17:42,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:42" (3/3) ... [2025-03-17 03:17:42,402 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-49.i [2025-03-17 03:17:42,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:17:42,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-49.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:17:42,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:17:42,459 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;@581f1374, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:17:42,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:17:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:17:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 03:17:42,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:42,475 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 03:17:42,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:42,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1339684424, now seen corresponding path program 1 times [2025-03-17 03:17:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:42,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-03-17 03:17:42,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:42,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 03:17:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 03:17:42,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:42,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 03:17:42,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-03-17 03:17:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122939266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117368501] [2025-03-17 03:17:42,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:42,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:17:42,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:42,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:17:42,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:17:42,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 03:17:42,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 03:17:42,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:42,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:42,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:17:42,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 03:17:43,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:17:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117368501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:43,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:17:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:17:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421282792] [2025-03-17 03:17:43,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:43,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:17:43,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:43,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:17:43,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:17:43,041 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:17:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:43,058 INFO L93 Difference]: Finished difference Result 157 states and 278 transitions. [2025-03-17 03:17:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:17:43,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2025-03-17 03:17:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:43,064 INFO L225 Difference]: With dead ends: 157 [2025-03-17 03:17:43,064 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 03:17:43,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-03-17 03:17:43,068 INFO L435 NwaCegarLoop]: 123 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, 123 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-03-17 03:17:43,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:17:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 03:17:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 03:17:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:17:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2025-03-17 03:17:43,096 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 167 [2025-03-17 03:17:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:43,097 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2025-03-17 03:17:43,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:17:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2025-03-17 03:17:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 03:17:43,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:43,100 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 03:17:43,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:17:43,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:17:43,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:43,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash -227005280, now seen corresponding path program 1 times [2025-03-17 03:17:43,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:43,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390537241] [2025-03-17 03:17:43,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 03:17:43,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 03:17:43,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:43,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:17:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390537241] [2025-03-17 03:17:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390537241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:44,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:44,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:17:44,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104479890] [2025-03-17 03:17:44,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:44,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:17:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:44,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:17:44,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:17:44,912 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:17:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:45,405 INFO L93 Difference]: Finished difference Result 259 states and 404 transitions. [2025-03-17 03:17:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:17:45,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2025-03-17 03:17:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:45,409 INFO L225 Difference]: With dead ends: 259 [2025-03-17 03:17:45,409 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 03:17:45,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:17:45,413 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 172 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:45,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 432 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:17:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 03:17:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2025-03-17 03:17:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 114 states have internal predecessors, (157), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 03:17:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 277 transitions. [2025-03-17 03:17:45,462 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 277 transitions. Word has length 167 [2025-03-17 03:17:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:45,464 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 277 transitions. [2025-03-17 03:17:45,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:17:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 277 transitions. [2025-03-17 03:17:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 03:17:45,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:45,485 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 03:17:45,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:17:45,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:45,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash -423518785, now seen corresponding path program 1 times [2025-03-17 03:17:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:45,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550052371] [2025-03-17 03:17:45,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:45,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:45,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 03:17:45,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 03:17:45,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:45,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:17:45,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:45,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550052371] [2025-03-17 03:17:45,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550052371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:45,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:45,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:17:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843967207] [2025-03-17 03:17:45,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:45,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:17:45,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:45,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:17:45,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:17:45,763 INFO L87 Difference]: Start difference. First operand 176 states and 277 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:17:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:45,927 INFO L93 Difference]: Finished difference Result 487 states and 762 transitions. [2025-03-17 03:17:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:17:45,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2025-03-17 03:17:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:45,936 INFO L225 Difference]: With dead ends: 487 [2025-03-17 03:17:45,936 INFO L226 Difference]: Without dead ends: 312 [2025-03-17 03:17:45,937 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-03-17 03:17:45,939 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:45,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 295 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:17:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-17 03:17:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 230. [2025-03-17 03:17:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 153 states have (on average 1.4183006535947713) internal successors, (217), 156 states have internal predecessors, (217), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:17:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 361 transitions. [2025-03-17 03:17:45,986 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 361 transitions. Word has length 167 [2025-03-17 03:17:45,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:45,987 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 361 transitions. [2025-03-17 03:17:45,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:17:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 361 transitions. [2025-03-17 03:17:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 03:17:45,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:45,991 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 03:17:45,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:17:45,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:45,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash 996886461, now seen corresponding path program 1 times [2025-03-17 03:17:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:45,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372256974] [2025-03-17 03:17:45,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:46,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 03:17:46,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 03:17:46,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:46,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 36 proven. 39 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 03:17:47,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372256974] [2025-03-17 03:17:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372256974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111579627] [2025-03-17 03:17:47,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:17:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:47,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:17:47,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:17:47,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 03:17:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 03:17:47,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:47,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:47,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 03:17:47,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-17 03:17:52,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:17:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111579627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:53,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:17:53,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2025-03-17 03:17:53,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239435651] [2025-03-17 03:17:53,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:17:53,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:17:53,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:53,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:17:53,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2025-03-17 03:17:53,181 INFO L87 Difference]: Start difference. First operand 230 states and 361 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-17 03:17:59,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:03,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:08,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:13,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:18,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:23,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:18:25,818 INFO L93 Difference]: Finished difference Result 477 states and 735 transitions. [2025-03-17 03:18:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:18:25,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 168 [2025-03-17 03:18:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:18:25,822 INFO L225 Difference]: With dead ends: 477 [2025-03-17 03:18:25,822 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 03:18:25,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=88, Invalid=253, Unknown=1, NotChecked=0, Total=342 [2025-03-17 03:18:25,823 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 215 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 52 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:18:25,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 428 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 485 Invalid, 6 Unknown, 0 Unchecked, 31.3s Time] [2025-03-17 03:18:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 03:18:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 205. [2025-03-17 03:18:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 140 states have internal predecessors, (188), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 03:18:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 308 transitions. [2025-03-17 03:18:25,852 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 308 transitions. Word has length 168 [2025-03-17 03:18:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:18:25,853 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 308 transitions. [2025-03-17 03:18:25,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-17 03:18:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 308 transitions. [2025-03-17 03:18:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 03:18:25,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:18:25,854 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 03:18:25,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:18:26,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 03:18:26,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:18:26,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:18:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash -800064898, now seen corresponding path program 1 times [2025-03-17 03:18:26,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:18:26,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917169477] [2025-03-17 03:18:26,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:26,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:18:26,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 03:18:26,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 03:18:26,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:18:26,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267637413] [2025-03-17 03:18:26,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:26,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:18:26,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:18:26,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:18:26,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:18:26,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 03:18:26,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 03:18:26,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:26,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:18:26,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:18:26,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 03:18:26,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 03:18:26,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:26,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:18:26,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:18:26,922 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:18:26,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:18:26,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:18:27,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:18:27,129 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:18:27,206 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:18:27,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:18:27 BoogieIcfgContainer [2025-03-17 03:18:27,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:18:27,209 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:18:27,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:18:27,210 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:18:27,210 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:42" (3/4) ... [2025-03-17 03:18:27,212 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:18:27,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:18:27,214 INFO L158 Benchmark]: Toolchain (without parser) took 45642.95ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 104.3MB in the beginning and 177.3MB in the end (delta: -73.0MB). Peak memory consumption was 163.9MB. Max. memory is 16.1GB. [2025-03-17 03:18:27,214 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:18:27,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.28ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 88.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:18:27,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.00ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 84.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:18:27,215 INFO L158 Benchmark]: Boogie Preprocessor took 42.52ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 78.7MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:18:27,215 INFO L158 Benchmark]: IcfgBuilder took 486.22ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 51.9MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:18:27,215 INFO L158 Benchmark]: TraceAbstraction took 44813.38ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 50.8MB in the beginning and 177.5MB in the end (delta: -126.6MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. [2025-03-17 03:18:27,215 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 377.5MB. Free memory was 177.5MB in the beginning and 177.3MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:18:27,216 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.28ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 88.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.00ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 84.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.52ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 78.7MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 486.22ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 51.9MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 44813.38ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 50.8MB in the beginning and 177.5MB in the end (delta: -126.6MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 377.5MB. Free memory was 177.5MB in the beginning and 177.3MB in the end (delta: 120.0kB). 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 someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] signed char var_1_3 = -5; [L24] double var_1_5 = 2.65; [L25] double var_1_6 = 100.375; [L26] double var_1_7 = 5.7; [L27] double var_1_8 = 0.1; [L28] double var_1_9 = 9999.4; [L29] double var_1_10 = 63.375; [L30] signed char var_1_11 = 1; [L31] double var_1_12 = 3.875; [L32] unsigned long int var_1_13 = 2; [L33] double var_1_14 = 1.375; [L34] float var_1_16 = 32.4; [L35] double var_1_17 = 255.25; [L36] unsigned char var_1_19 = 1; [L37] unsigned char var_1_20 = 1; [L38] unsigned char var_1_21 = 50; [L39] unsigned char var_1_22 = 1; [L40] unsigned char var_1_23 = 0; [L41] unsigned char var_1_24 = 0; [L42] double var_1_25 = -0.8; [L43] unsigned short int var_1_26 = 16; [L44] signed short int var_1_28 = -32; [L45] signed short int var_1_29 = 5; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] float last_1_var_1_16 = 32.4; [L49] unsigned char last_1_var_1_19 = 1; [L50] unsigned char last_1_var_1_30 = 0; [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_19 = var_1_19 [L185] last_1_var_1_30 = var_1_30 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L141] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L144] var_1_6 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L146] var_1_7 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L148] var_1_8 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_9=49997/5] [L149] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20, var_1_9=49997/5] [L150] var_1_9 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L151] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L152] var_1_11 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L153] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L154] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L154] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L155] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L155] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L156] var_1_12 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L158] var_1_14 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L159] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L160] var_1_20 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L161] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L162] CALL assume_abort_if_not(var_1_20 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L162] RET assume_abort_if_not(var_1_20 <= 128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L163] var_1_21 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L164] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L165] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L165] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L166] var_1_22 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L167] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L168] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L168] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L169] var_1_23 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L170] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L171] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L171] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L172] var_1_24 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L173] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L174] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L174] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L175] var_1_29 = __VERIFIER_nondet_short() [L176] CALL assume_abort_if_not(var_1_29 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L176] RET assume_abort_if_not(var_1_29 >= -16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L177] CALL assume_abort_if_not(var_1_29 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L177] RET assume_abort_if_not(var_1_29 <= 16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=0, var_1_3=6, var_1_5=53/20] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L179] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L196] RET updateVariables() [L197] CALL step() [L54] unsigned char stepLocal_6 = var_1_24; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_6=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L55] COND FALSE !(last_1_var_1_30 || stepLocal_6) [L66] var_1_26 = var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L68] COND TRUE (var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14) [L69] var_1_13 = (128u + var_1_26) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L73] unsigned short int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_0=2, var_1_10=507/8, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L74] COND TRUE (-32 * (var_1_13 / var_1_3)) >= stepLocal_0 [L75] var_1_1 = ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L77] signed long int stepLocal_7 = - 1000; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_7=-1000, var_1_10=507/8, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L78] COND TRUE stepLocal_7 <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) [L79] var_1_28 = (var_1_29 + var_1_1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L83] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_1=136, var_1_10=507/8, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_5=53/20] [L84] COND TRUE stepLocal_1 >= 32 [L85] var_1_5 = (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6] [L89] COND TRUE var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) [L90] var_1_10 = (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6] [L94] signed long int stepLocal_2 = var_1_26 % (var_1_20 + var_1_21); VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_2=2, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6] [L95] COND FALSE !(stepLocal_2 <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) [L98] var_1_19 = (! var_1_22) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6] [L100] signed char stepLocal_5 = var_1_11; [L101] unsigned short int stepLocal_4 = var_1_26; [L102] unsigned char stepLocal_3 = var_1_20; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, stepLocal_4=2, stepLocal_5=-19, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6] [L103] COND TRUE stepLocal_4 >= var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, stepLocal_5=-19, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6] [L104] COND FALSE !(stepLocal_5 > var_1_26) [L113] var_1_25 = var_1_8 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_8=2] [L116] signed long int stepLocal_8 = (0 ^ var_1_1) + var_1_29; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, stepLocal_8=-16246, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=0, var_1_31=1, var_1_3=6, var_1_8=2] [L117] COND TRUE stepLocal_8 < var_1_11 [L118] var_1_30 = (var_1_22 && (var_1_19 || var_1_31)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=1, var_1_31=1, var_1_3=6, var_1_8=2] [L122] COND FALSE !(var_1_25 >= var_1_9) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=1, var_1_31=1, var_1_3=6, var_1_8=2] [L127] COND FALSE !((var_1_5 != var_1_12) && var_1_30) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=1, var_1_31=1, var_1_3=6, var_1_8=2] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return ((((((((((((-32 * (var_1_13 / var_1_3)) >= var_1_26) ? (var_1_1 == ((signed long int) ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))))) : 1) && ((var_1_1 >= 32) ? (var_1_5 == ((double) (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)))) : (var_1_5 == ((double) 0.8)))) && ((var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10 == ((double) (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))))) : (var_1_10 == ((double) ((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))))))) && (((var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14)) ? (var_1_13 == ((unsigned long int) (128u + var_1_26))) : (var_1_13 == ((unsigned long int) var_1_26)))) && ((var_1_25 >= var_1_9) ? ((var_1_9 < var_1_14) ? (var_1_16 == ((float) var_1_8)) : 1) : 1)) && (((var_1_5 != var_1_12) && var_1_30) ? ((var_1_12 >= (var_1_9 * var_1_7)) ? ((var_1_11 >= var_1_26) ? (var_1_17 == ((double) var_1_12)) : (var_1_17 == ((double) var_1_7))) : (var_1_17 == ((double) var_1_6))) : 1)) && (((var_1_26 % (var_1_20 + var_1_21)) <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? (var_1_19 == ((unsigned char) (((! var_1_22) || var_1_23) || var_1_24))) : (var_1_19 == ((unsigned char) (! var_1_22))))) && ((var_1_26 >= var_1_20) ? ((var_1_11 > var_1_26) ? (((((((10) > (var_1_3)) ? (10) : (var_1_3))) + var_1_28) >= var_1_20) ? ((! var_1_19) ? (var_1_25 == ((double) (var_1_9 - var_1_8))) : 1) : (var_1_25 == ((double) var_1_9))) : (var_1_25 == ((double) var_1_8))) : 1)) && ((last_1_var_1_30 || var_1_24) ? (last_1_var_1_19 ? (var_1_26 == ((unsigned short int) ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) : ((var_1_12 == last_1_var_1_16) ? (var_1_23 ? (var_1_26 == ((unsigned short int) var_1_20)) : 1) : 1)) : (var_1_26 == ((unsigned short int) var_1_20)))) && (((- 1000) <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_28 == ((signed short int) (var_1_29 + var_1_1))) : (var_1_28 == ((signed short int) -5)))) && ((((0 ^ var_1_1) + var_1_29) < var_1_11) ? (var_1_30 == ((unsigned char) (var_1_22 && (var_1_19 || var_1_31)))) : (var_1_30 == ((unsigned char) var_1_22))) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=1, var_1_31=1, var_1_3=6, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-19, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=136, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-16246, var_1_29=-16382, var_1_30=1, var_1_31=1, var_1_3=6, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 153 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.7s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 466 SdHoareTripleChecker+Valid, 31.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 454 mSDsluCounter, 1278 SdHoareTripleChecker+Invalid, 28.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 715 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 670 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 563 mSDtfsCounter, 670 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 131 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 998 ConstructedInterpolants, 1 QuantifiedInterpolants, 2264 SizeOfPredicates, 4 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 7672/7800 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-03-17 03:18:27,426 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-17 03:18:27,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eeb4616c82dd418b721c618c54512d08e3a8ea8d5c6a2fdf9225b3e79e147c74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:18:29,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:18:29,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:18:29,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:18:29,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:18:29,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:18:29,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:18:29,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:18:29,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:18:29,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:18:29,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:18:29,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:18:29,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:18:29,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:18:29,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:18:29,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:18:29,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:18:29,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:18:29,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:18:29,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:18:29,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:18:29,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:18:29,376 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/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 -> eeb4616c82dd418b721c618c54512d08e3a8ea8d5c6a2fdf9225b3e79e147c74 [2025-03-17 03:18:29,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:18:29,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:18:29,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:18:29,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:18:29,640 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:18:29,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i [2025-03-17 03:18:30,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6832a7100/e770d6111ae149659e66c7de4af9d4da/FLAGbea0b2adf [2025-03-17 03:18:31,033 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:18:31,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i [2025-03-17 03:18:31,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6832a7100/e770d6111ae149659e66c7de4af9d4da/FLAGbea0b2adf [2025-03-17 03:18:31,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6832a7100/e770d6111ae149659e66c7de4af9d4da [2025-03-17 03:18:31,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:18:31,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:18:31,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:18:31,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:18:31,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:18:31,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dff06c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31, skipping insertion in model container [2025-03-17 03:18:31,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:18:31,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i[916,929] [2025-03-17 03:18:31,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:18:31,299 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:18:31,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i[916,929] [2025-03-17 03:18:31,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:18:31,351 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:18:31,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31 WrapperNode [2025-03-17 03:18:31,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:18:31,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:18:31,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:18:31,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:18:31,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,404 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-03-17 03:18:31,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:18:31,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:18:31,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:18:31,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:18:31,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,443 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-03-17 03:18:31,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:18:31,469 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:18:31,469 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:18:31,469 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:18:31,470 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (1/1) ... [2025-03-17 03:18:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:18:31,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:18:31,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:18:31,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:18:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:18:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:18:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:18:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:18:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:18:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:18:31,613 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:18:31,614 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:18:53,310 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 03:18:53,310 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:18:53,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:18:53,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:18:53,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:18:53 BoogieIcfgContainer [2025-03-17 03:18:53,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:18:53,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:18:53,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:18:53,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:18:53,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:18:31" (1/3) ... [2025-03-17 03:18:53,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7089ccc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:18:53, skipping insertion in model container [2025-03-17 03:18:53,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:31" (2/3) ... [2025-03-17 03:18:53,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7089ccc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:18:53, skipping insertion in model container [2025-03-17 03:18:53,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:18:53" (3/3) ... [2025-03-17 03:18:53,325 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-49.i [2025-03-17 03:18:53,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:18:53,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-49.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:18:53,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:18:53,387 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;@2954b7e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:18:53,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:18:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:18:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 03:18:53,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:18:53,399 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 03:18:53,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:18:53,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:18:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1339684424, now seen corresponding path program 1 times [2025-03-17 03:18:53,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:18:53,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602853933] [2025-03-17 03:18:53,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:53,410 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-03-17 03:18:53,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:18:53,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:18:53,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:18:53,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 03:18:54,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 03:18:54,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:54,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:54,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:18:54,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:18:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2025-03-17 03:18:54,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:18:54,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:18:54,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602853933] [2025-03-17 03:18:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602853933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:18:54,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:18:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:18:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336480490] [2025-03-17 03:18:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:18:54,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:18:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:18:54,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:18:54,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:18:54,592 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:18:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:18:54,616 INFO L93 Difference]: Finished difference Result 157 states and 278 transitions. [2025-03-17 03:18:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:18:54,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2025-03-17 03:18:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:18:54,624 INFO L225 Difference]: With dead ends: 157 [2025-03-17 03:18:54,625 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 03:18:54,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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-03-17 03:18:54,630 INFO L435 NwaCegarLoop]: 123 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, 123 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-03-17 03:18:54,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:18:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 03:18:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 03:18:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:18:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2025-03-17 03:18:54,668 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 167 [2025-03-17 03:18:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:18:54,668 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2025-03-17 03:18:54,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:18:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2025-03-17 03:18:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 03:18:54,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:18:54,674 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 03:18:54,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:18:54,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:18:54,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:18:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:18:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -227005280, now seen corresponding path program 1 times [2025-03-17 03:18:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:18:54,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432455917] [2025-03-17 03:18:54,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:54,876 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-03-17 03:18:54,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:18:54,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:18:54,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:18:54,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 03:18:56,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 03:18:56,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:56,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:56,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:18:56,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:19:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 688 proven. 72 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-17 03:19:03,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:19:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:19:05,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:19:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432455917] [2025-03-17 03:19:05,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432455917] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 03:19:05,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:19:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-17 03:19:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309248101] [2025-03-17 03:19:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:19:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:19:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:19:05,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:19:05,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:19:05,812 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:19:10,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:19:14,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:19:18,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []