./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_50-1loop_file-32.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 3d2cf0a7074bcf0b96169875d5770b78078c347fd202e9f8698bc98c30c1867a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:42:16,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:42:16,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:42:16,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:42:16,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:42:16,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:42:16,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:42:16,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:42:16,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:42:16,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:42:16,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:42:16,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:42:16,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:42:16,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:42:16,642 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:42:16,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:42:16,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:42:16,642 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:42:16,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:42:16,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:42:16,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:42:16,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:42:16,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:42:16,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:42:16,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:42:16,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:42:16,644 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 -> 3d2cf0a7074bcf0b96169875d5770b78078c347fd202e9f8698bc98c30c1867a [2025-03-08 14:42:16,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:42:16,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:42:16,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:42:16,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:42:16,886 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:42:16,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-32.i [2025-03-08 14:42:18,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f45ec945/80d3bac26c884b11927f327d8d706042/FLAGd736e43ec [2025-03-08 14:42:18,285 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:42:18,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-32.i [2025-03-08 14:42:18,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f45ec945/80d3bac26c884b11927f327d8d706042/FLAGd736e43ec [2025-03-08 14:42:18,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f45ec945/80d3bac26c884b11927f327d8d706042 [2025-03-08 14:42:18,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:42:18,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:42:18,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:42:18,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:42:18,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:42:18,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3014fb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18, skipping insertion in model container [2025-03-08 14:42:18,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:42:18,445 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_50-1loop_file-32.i[915,928] [2025-03-08 14:42:18,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:42:18,506 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:42:18,513 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_50-1loop_file-32.i[915,928] [2025-03-08 14:42:18,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:42:18,542 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:42:18,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18 WrapperNode [2025-03-08 14:42:18,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:42:18,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:42:18,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:42:18,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:42:18,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,583 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-08 14:42:18,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:42:18,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:42:18,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:42:18,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:42:18,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,610 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-08 14:42:18,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:42:18,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:42:18,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:42:18,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:42:18,627 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (1/1) ... [2025-03-08 14:42:18,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:42:18,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:42:18,653 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-08 14:42:18,656 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-08 14:42:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:42:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:42:18,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:42:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:42:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:42:18,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:42:18,729 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:42:18,731 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:42:18,974 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:42:18,974 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:42:18,981 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:42:18,981 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:42:18,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:42:18 BoogieIcfgContainer [2025-03-08 14:42:18,981 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:42:18,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:42:18,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:42:18,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:42:18,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:42:18" (1/3) ... [2025-03-08 14:42:18,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6216be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:42:18, skipping insertion in model container [2025-03-08 14:42:18,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:18" (2/3) ... [2025-03-08 14:42:18,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6216be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:42:18, skipping insertion in model container [2025-03-08 14:42:18,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:42:18" (3/3) ... [2025-03-08 14:42:18,988 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-32.i [2025-03-08 14:42:18,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:42:18,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-32.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:42:19,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:42:19,055 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;@1d034d5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:42:19,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:42:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 14:42:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 14:42:19,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:42:19,068 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:42:19,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:42:19,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:42:19,075 INFO L85 PathProgramCache]: Analyzing trace with hash 830632164, now seen corresponding path program 1 times [2025-03-08 14:42:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:42:19,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004369671] [2025-03-08 14:42:19,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:42:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:42:19,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 14:42:19,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 14:42:19,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:19,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:42:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 14:42:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:42:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004369671] [2025-03-08 14:42:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004369671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:42:19,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741750485] [2025-03-08 14:42:19,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:42:19,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:42:19,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:42:19,312 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-08 14:42:19,313 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-08 14:42:19,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 14:42:19,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 14:42:19,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:19,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:42:19,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:42:19,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:42:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 14:42:19,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:42:19,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741750485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:42:19,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:42:19,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:42:19,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858919531] [2025-03-08 14:42:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:42:19,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:42:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:42:19,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:42:19,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:42:19,494 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 14:42:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:42:19,510 INFO L93 Difference]: Finished difference Result 119 states and 200 transitions. [2025-03-08 14:42:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:42:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2025-03-08 14:42:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:42:19,517 INFO L225 Difference]: With dead ends: 119 [2025-03-08 14:42:19,517 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 14:42:19,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:42:19,521 INFO L435 NwaCegarLoop]: 90 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, 90 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-08 14:42:19,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:42:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 14:42:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 14:42:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 14:42:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-03-08 14:42:19,554 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 123 [2025-03-08 14:42:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:42:19,554 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-03-08 14:42:19,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 14:42:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-03-08 14:42:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 14:42:19,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:42:19,558 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:42:19,565 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-08 14:42:19,762 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-08 14:42:19,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:42:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:42:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1228136601, now seen corresponding path program 1 times [2025-03-08 14:42:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:42:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536290249] [2025-03-08 14:42:19,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:42:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:42:19,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 14:42:19,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 14:42:19,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:19,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:42:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 14:42:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:42:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536290249] [2025-03-08 14:42:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536290249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:42:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824145988] [2025-03-08 14:42:20,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:42:20,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:42:20,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:42:20,138 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-08 14:42:20,150 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-08 14:42:20,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 14:42:20,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 14:42:20,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:20,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:42:20,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:42:20,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:42:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-08 14:42:20,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:42:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 14:42:20,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824145988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:42:20,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:42:20,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 14:42:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902293973] [2025-03-08 14:42:20,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:42:20,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:42:20,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:42:20,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:42:20,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:42:20,497 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:42:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:42:20,713 INFO L93 Difference]: Finished difference Result 145 states and 216 transitions. [2025-03-08 14:42:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 14:42:20,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 123 [2025-03-08 14:42:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:42:20,715 INFO L225 Difference]: With dead ends: 145 [2025-03-08 14:42:20,715 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 14:42:20,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:42:20,716 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 87 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:42:20,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 181 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:42:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 14:42:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2025-03-08 14:42:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 50 states have internal predecessors, (60), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 14:42:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 126 transitions. [2025-03-08 14:42:20,729 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 126 transitions. Word has length 123 [2025-03-08 14:42:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:42:20,730 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 126 transitions. [2025-03-08 14:42:20,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:42:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 126 transitions. [2025-03-08 14:42:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 14:42:20,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:42:20,731 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:42:20,738 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-08 14:42:20,932 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,SelfDestructingSolverStorable1 [2025-03-08 14:42:20,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:42:20,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:42:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1739369467, now seen corresponding path program 1 times [2025-03-08 14:42:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:42:20,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045973926] [2025-03-08 14:42:20,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:42:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:42:20,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 14:42:21,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 14:42:21,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:21,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:42:21,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:42:21,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 14:42:21,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 14:42:21,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:21,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:42:21,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:42:21,115 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:42:21,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:42:21,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:42:21,121 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:42:21,195 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:42:21,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:42:21 BoogieIcfgContainer [2025-03-08 14:42:21,197 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:42:21,198 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:42:21,198 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:42:21,198 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:42:21,199 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:42:18" (3/4) ... [2025-03-08 14:42:21,200 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:42:21,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:42:21,201 INFO L158 Benchmark]: Toolchain (without parser) took 2891.69ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 94.9MB in the end (delta: 17.2MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2025-03-08 14:42:21,201 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:42:21,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.45ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:42:21,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.03ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:42:21,202 INFO L158 Benchmark]: Boogie Preprocessor took 41.58ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 90.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:42:21,202 INFO L158 Benchmark]: IcfgBuilder took 355.46ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 69.9MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 14:42:21,202 INFO L158 Benchmark]: TraceAbstraction took 2214.50ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 94.9MB in the end (delta: -25.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2025-03-08 14:42:21,202 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 94.9MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:42:21,203 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.45ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.03ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.58ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 90.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.46ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 69.9MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2214.50ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 94.9MB in the end (delta: -25.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 94.9MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 63, overapproximation of someBinaryArithmeticFLOAToperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] unsigned char last_1_var_1_1 = 2; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L134] isInitial = 1 [L135] FCALL initially() [L136] int k_loop; [L137] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L137] COND TRUE k_loop < 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_15 = var_1_15 [L127] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] var_1_6 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L104] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L105] var_1_8 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_9=201/2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_9=201/2] [L107] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L107] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L109] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L110] var_1_12 = __VERIFIER_nondet_float() [L111] 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_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L111] 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_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L114] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L115] var_1_17 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L116] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L121] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L122] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L122] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L139] RET updateVariables() [L140] CALL step() [L48] COND FALSE !(var_1_5 >= var_1_6) [L57] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L59] unsigned char stepLocal_1 = var_1_15; [L60] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L61] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L62] COND TRUE var_1_15 && stepLocal_1 [L63] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L68] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L77] COND TRUE var_1_11 == var_1_18 [L78] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=5, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L80] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=5, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L83] COND TRUE (var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5 [L84] var_1_9 = ((4.5f + var_1_11) - var_1_12) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=5, var_1_21=-27, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0] [L88] var_1_22 = var_1_12 [L89] var_1_23 = var_1_8 [L90] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=5, var_1_21=-27, var_1_22=100000005, var_1_23=0, var_1_24=64, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0] [L140] RET step() [L141] CALL, EXPR property() [L130-L131] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=5, var_1_21=-27, var_1_22=100000005, var_1_23=0, var_1_24=64, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=5, var_1_21=-27, var_1_22=100000005, var_1_23=0, var_1_24=64, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=5, var_1_21=-27, var_1_22=100000005, var_1_23=0, var_1_24=64, var_1_4=-8097, var_1_5=32, var_1_6=64, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 111 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 271 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 178 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3348/3420 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-08 14:42:21,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_50-1loop_file-32.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 3d2cf0a7074bcf0b96169875d5770b78078c347fd202e9f8698bc98c30c1867a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:42:23,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:42:23,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:42:23,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:42:23,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:42:23,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:42:23,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:42:23,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:42:23,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:42:23,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:42:23,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:42:23,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:42:23,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:42:23,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:42:23,166 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:42:23,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:42:23,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:42:23,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:42:23,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:42:23,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:42:23,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:42:23,171 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:42:23,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:42:23,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:42:23,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:42:23,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:42:23,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:42:23,171 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 -> 3d2cf0a7074bcf0b96169875d5770b78078c347fd202e9f8698bc98c30c1867a [2025-03-08 14:42:23,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:42:23,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:42:23,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:42:23,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:42:23,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:42:23,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-32.i [2025-03-08 14:42:24,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e45a05f8/31b02aa937894457b202a7b678ba89dc/FLAGb7dafe855 [2025-03-08 14:42:24,769 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:42:24,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-32.i [2025-03-08 14:42:24,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e45a05f8/31b02aa937894457b202a7b678ba89dc/FLAGb7dafe855 [2025-03-08 14:42:25,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e45a05f8/31b02aa937894457b202a7b678ba89dc [2025-03-08 14:42:25,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:42:25,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:42:25,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:42:25,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:42:25,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:42:25,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57846620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25, skipping insertion in model container [2025-03-08 14:42:25,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:42:25,255 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_50-1loop_file-32.i[915,928] [2025-03-08 14:42:25,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:42:25,312 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:42:25,320 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_50-1loop_file-32.i[915,928] [2025-03-08 14:42:25,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:42:25,352 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:42:25,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25 WrapperNode [2025-03-08 14:42:25,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:42:25,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:42:25,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:42:25,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:42:25,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,394 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-03-08 14:42:25,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:42:25,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:42:25,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:42:25,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:42:25,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,426 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-08 14:42:25,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:42:25,450 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:42:25,454 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:42:25,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:42:25,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (1/1) ... [2025-03-08 14:42:25,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:42:25,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:42:25,484 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-08 14:42:25,490 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-08 14:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:42:25,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:42:25,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:42:25,553 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:42:25,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:42:28,087 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:42:28,087 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:42:28,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:42:28,094 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:42:28,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:42:28 BoogieIcfgContainer [2025-03-08 14:42:28,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:42:28,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:42:28,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:42:28,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:42:28,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:42:25" (1/3) ... [2025-03-08 14:42:28,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b7020c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:42:28, skipping insertion in model container [2025-03-08 14:42:28,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:25" (2/3) ... [2025-03-08 14:42:28,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b7020c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:42:28, skipping insertion in model container [2025-03-08 14:42:28,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:42:28" (3/3) ... [2025-03-08 14:42:28,101 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-32.i [2025-03-08 14:42:28,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:42:28,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-32.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:42:28,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:42:28,158 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;@4617ea10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:42:28,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:42:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 14:42:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 14:42:28,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:42:28,170 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:42:28,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:42:28,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:42:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash 830632164, now seen corresponding path program 1 times [2025-03-08 14:42:28,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:42:28,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610639419] [2025-03-08 14:42:28,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:42:28,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:42:28,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:42:28,185 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-08 14:42:28,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:42:28,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 14:42:28,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 14:42:28,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:28,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:42:28,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:42:28,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:42:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 14:42:28,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:42:28,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:42:28,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610639419] [2025-03-08 14:42:28,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610639419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:42:28,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:42:28,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:42:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325173059] [2025-03-08 14:42:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:42:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:42:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:42:28,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:42:28,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:42:28,510 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 14:42:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:42:28,524 INFO L93 Difference]: Finished difference Result 119 states and 200 transitions. [2025-03-08 14:42:28,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:42:28,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2025-03-08 14:42:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:42:28,530 INFO L225 Difference]: With dead ends: 119 [2025-03-08 14:42:28,531 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 14:42:28,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-08 14:42:28,535 INFO L435 NwaCegarLoop]: 90 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, 90 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-08 14:42:28,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:42:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 14:42:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 14:42:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 14:42:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-03-08 14:42:28,565 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 123 [2025-03-08 14:42:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:42:28,565 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-03-08 14:42:28,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 14:42:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-03-08 14:42:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 14:42:28,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:42:28,568 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:42:28,577 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-08 14:42:28,773 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-08 14:42:28,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:42:28,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:42:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1228136601, now seen corresponding path program 1 times [2025-03-08 14:42:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:42:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658312252] [2025-03-08 14:42:28,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:42:28,774 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-08 14:42:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:42:28,776 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-08 14:42:28,777 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-08 14:42:28,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 14:42:28,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 14:42:28,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:28,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:42:28,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 14:42:28,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:42:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-08 14:42:29,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:42:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 14:42:29,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:42:29,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658312252] [2025-03-08 14:42:29,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658312252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:42:29,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:42:29,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 14:42:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071230841] [2025-03-08 14:42:29,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:42:29,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:42:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:42:29,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:42:29,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:42:29,509 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:42:31,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:42:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:42:32,078 INFO L93 Difference]: Finished difference Result 145 states and 216 transitions. [2025-03-08 14:42:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 14:42:32,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 123 [2025-03-08 14:42:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:42:32,080 INFO L225 Difference]: With dead ends: 145 [2025-03-08 14:42:32,080 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 14:42:32,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:42:32,081 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:42:32,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 195 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 14:42:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 14:42:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2025-03-08 14:42:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 50 states have internal predecessors, (60), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 14:42:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 126 transitions. [2025-03-08 14:42:32,100 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 126 transitions. Word has length 123 [2025-03-08 14:42:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:42:32,101 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 126 transitions. [2025-03-08 14:42:32,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 14:42:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 126 transitions. [2025-03-08 14:42:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 14:42:32,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:42:32,102 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:42:32,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 14:42:32,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:42:32,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:42:32,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:42:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1739369467, now seen corresponding path program 1 times [2025-03-08 14:42:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:42:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522136293] [2025-03-08 14:42:32,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:42:32,304 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-08 14:42:32,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:42:32,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:42:32,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:42:32,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 14:42:32,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 14:42:32,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:42:32,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:42:32,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 14:42:32,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:42:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-08 14:42:46,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:43:12,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:43:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522136293] [2025-03-08 14:43:12,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522136293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:43:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [637109992] [2025-03-08 14:43:12,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:43:12,120 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 14:43:12,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 14:43:12,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 14:43:12,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 14:43:12,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 14:43:12,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 14:43:12,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:43:12,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:43:12,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 14:43:12,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:43:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-08 14:43:19,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:43:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [637109992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:43:28,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:43:28,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-08 14:43:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032848227] [2025-03-08 14:43:28,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:43:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:43:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:43:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:43:28,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=96, Unknown=2, NotChecked=0, Total=132 [2025-03-08 14:43:28,019 INFO L87 Difference]: Start difference. First operand 85 states and 126 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 14:43:44,860 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 40 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 14:43:48,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:43:54,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:43:58,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:44:02,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]