./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.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-82.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 a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:48:42,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:48:42,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:48:42,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:48:42,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:48:42,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:48:42,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:48:42,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:48:42,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:48:42,758 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:48:42,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:48:42,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:48:42,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:48:42,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:48:42,759 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:48:42,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:48:42,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:48:42,759 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:48:42,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:48:42,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:48:42,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:48:42,760 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:48:42,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:48:42,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:48:42,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:48:42,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:48:42,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:48:42,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:48:42,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:48:42,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:48:42,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:48:42,761 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 -> a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 [2025-03-08 14:48:42,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:48:42,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:48:42,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:48:42,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:48:42,987 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:48:42,987 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-82.i [2025-03-08 14:48:44,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0623dc9a/237fd516b4b24de9882f28d0725b78b6/FLAGba4a310d5 [2025-03-08 14:48:44,299 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:48:44,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2025-03-08 14:48:44,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0623dc9a/237fd516b4b24de9882f28d0725b78b6/FLAGba4a310d5 [2025-03-08 14:48:44,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0623dc9a/237fd516b4b24de9882f28d0725b78b6 [2025-03-08 14:48:44,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:48:44,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:48:44,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:48:44,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:48:44,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:48:44,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44, skipping insertion in model container [2025-03-08 14:48:44,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:48:44,456 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-82.i[915,928] [2025-03-08 14:48:44,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:48:44,514 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:48:44,523 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-82.i[915,928] [2025-03-08 14:48:44,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:48:44,568 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:48:44,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44 WrapperNode [2025-03-08 14:48:44,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:48:44,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:48:44,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:48:44,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:48:44,575 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:48:44" (1/1) ... [2025-03-08 14:48:44,580 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:48:44" (1/1) ... [2025-03-08 14:48:44,598 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2025-03-08 14:48:44,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:48:44,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:48:44,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:48:44,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:48:44,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,617 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:48:44,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:48:44,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:48:44,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:48:44,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:48:44,630 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (1/1) ... [2025-03-08 14:48:44,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:48:44,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:48:44,654 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:48:44,658 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:48:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:48:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:48:44,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:48:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:48:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:48:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:48:44,743 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:48:44,744 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:48:44,950 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:48:44,951 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:48:44,959 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:48:44,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:48:44,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:48:44 BoogieIcfgContainer [2025-03-08 14:48:44,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:48:44,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:48:44,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:48:44,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:48:44,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:48:44" (1/3) ... [2025-03-08 14:48:44,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd4ab5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:48:44, skipping insertion in model container [2025-03-08 14:48:44,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:44" (2/3) ... [2025-03-08 14:48:44,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd4ab5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:48:44, skipping insertion in model container [2025-03-08 14:48:44,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:48:44" (3/3) ... [2025-03-08 14:48:44,970 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-82.i [2025-03-08 14:48:44,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:48:44,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-82.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:48:45,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:48:45,029 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;@6cafb5d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:48:45,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:48:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:48:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 14:48:45,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:48:45,043 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:48:45,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:48:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:48:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 688523504, now seen corresponding path program 1 times [2025-03-08 14:48:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:48:45,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936674473] [2025-03-08 14:48:45,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:48:45,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:48:45,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 14:48:45,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 14:48:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:48:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:48:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 14:48:45,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:48:45,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936674473] [2025-03-08 14:48:45,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936674473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:48:45,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183982463] [2025-03-08 14:48:45,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:48:45,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:48:45,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:48:45,251 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:48:45,252 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:48:45,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 14:48:45,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 14:48:45,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:48:45,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:48:45,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:48:45,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:48:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 14:48:45,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:48:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183982463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:48:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:48:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:48:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316900272] [2025-03-08 14:48:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:48:45,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:48:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:48:45,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:48:45,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:48:45,397 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 14:48:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:48:45,413 INFO L93 Difference]: Finished difference Result 119 states and 197 transitions. [2025-03-08 14:48:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:48:45,415 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-03-08 14:48:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:48:45,419 INFO L225 Difference]: With dead ends: 119 [2025-03-08 14:48:45,420 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 14:48:45,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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:48:45,425 INFO L435 NwaCegarLoop]: 88 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, 88 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:48:45,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:48:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 14:48:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 14:48:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:48:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-08 14:48:45,452 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 128 [2025-03-08 14:48:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:48:45,452 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-08 14:48:45,452 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 14:48:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-08 14:48:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 14:48:45,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:48:45,456 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:48:45,463 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:48:45,656 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:48:45,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:48:45,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:48:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash 544487796, now seen corresponding path program 1 times [2025-03-08 14:48:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:48:45,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221403480] [2025-03-08 14:48:45,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:48:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:48:45,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 14:48:45,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 14:48:45,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:48:45,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:48:45,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:48:45,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 14:48:45,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 14:48:45,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:48:45,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:48:45,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:48:45,940 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:48:45,941 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:48:45,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:48:45,944 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:48:46,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:48:46,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:48:46 BoogieIcfgContainer [2025-03-08 14:48:46,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:48:46,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:48:46,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:48:46,009 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:48:46,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:48:44" (3/4) ... [2025-03-08 14:48:46,011 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:48:46,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:48:46,012 INFO L158 Benchmark]: Toolchain (without parser) took 1685.87ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 105.1MB in the end (delta: 27.7MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2025-03-08 14:48:46,013 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:48:46,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.45ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 119.4MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:48:46,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.51ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 117.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:48:46,013 INFO L158 Benchmark]: Boogie Preprocessor took 26.41ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:48:46,013 INFO L158 Benchmark]: IcfgBuilder took 333.32ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 97.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:48:46,014 INFO L158 Benchmark]: TraceAbstraction took 1046.14ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 105.2MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:48:46,014 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:48:46,015 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.26ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.45ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 119.4MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.51ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 117.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.41ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 333.32ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 97.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1046.14ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 105.2MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 48, overapproximation of someBinaryArithmeticDOUBLEoperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] double var_1_4 = 5.5; [L24] float var_1_5 = 49.2; [L25] double var_1_7 = 49.5; [L26] double var_1_8 = 999999999999.4; [L27] double var_1_9 = 255.3; [L28] unsigned char var_1_10 = 1; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_13 = 1; [L31] signed long int var_1_14 = -16; [L32] signed long int var_1_15 = 25; [L33] signed long int var_1_16 = -8; [L34] signed long int var_1_17 = 1000000000; [L35] signed long int var_1_18 = 256; [L36] signed long int var_1_19 = 25; [L37] signed long int var_1_20 = 4; [L38] unsigned char var_1_21 = 1; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 50; [L41] double last_1_var_1_7 = 49.5; [L42] signed long int last_1_var_1_14 = -16; [L43] signed long int last_1_var_1_23 = 50; VAL [isInitial=0, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_4=11/2, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L131] isInitial = 1 [L132] FCALL initially() [L133] int k_loop; [L134] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_4=11/2, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L134] COND TRUE k_loop < 1 [L135] CALL updateLastVariables() [L122] last_1_var_1_7 = var_1_7 [L123] last_1_var_1_14 = var_1_14 [L124] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_4=11/2, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L135] RET updateLastVariables() [L136] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L89] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L90] var_1_5 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L91] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L92] var_1_8 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L93] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L94] var_1_9 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L95] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L97] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L98] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L98] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L99] var_1_13 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L100] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L101] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L101] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L102] var_1_15 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_15 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L103] RET assume_abort_if_not(var_1_15 >= -1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L104] CALL assume_abort_if_not(var_1_15 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L104] RET assume_abort_if_not(var_1_15 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L105] var_1_17 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_17 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L106] RET assume_abort_if_not(var_1_17 >= 536870911) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L107] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L107] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L108] var_1_18 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L109] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L110] CALL assume_abort_if_not(var_1_18 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L110] RET assume_abort_if_not(var_1_18 <= 536870911) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L111] var_1_19 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L112] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L113] CALL assume_abort_if_not(var_1_19 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L113] RET assume_abort_if_not(var_1_19 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L114] var_1_20 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L116] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L116] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L117] var_1_22 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L118] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L119] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L119] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L136] RET updateVariables() [L137] CALL step() [L47] var_1_23 = last_1_var_1_14 [L48] var_1_7 = (var_1_4 - (var_1_8 + var_1_9)) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16] [L49] COND TRUE var_1_8 <= (((((var_1_5 * 1.25)) > ((last_1_var_1_7 * var_1_9))) ? ((var_1_5 * 1.25)) : ((last_1_var_1_7 * var_1_9)))) [L50] var_1_16 = ((((((last_1_var_1_23) < 0 ) ? -(last_1_var_1_23) : (last_1_var_1_23))) + last_1_var_1_23) + ((var_1_17 - var_1_18) - ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16] [L56] signed long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, stepLocal_0=-16, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16] [L57] COND TRUE stepLocal_0 == var_1_16 [L58] var_1_1 = (var_1_4 - 4.531) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16] [L66] signed long int stepLocal_1 = (50 / -10) + var_1_23; VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, stepLocal_1=-21, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16] [L67] COND FALSE !(stepLocal_1 >= var_1_16) [L74] var_1_21 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L76] var_1_10 = (var_1_11 && (var_1_21 || var_1_13)) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L77] COND FALSE !(var_1_8 <= ((((var_1_4) > ((var_1_1 + var_1_5))) ? (var_1_4) : ((var_1_1 + var_1_5))))) [L84] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L137] RET step() [L138] CALL, EXPR property() [L127-L128] return (((((((var_1_23 == var_1_16) ? (var_1_1 == ((double) (var_1_4 - 4.531))) : (((var_1_4 - var_1_5) > var_1_7) ? (var_1_1 == ((double) var_1_4)) : (var_1_1 == ((double) var_1_4)))) && (var_1_7 == ((double) (var_1_4 - (var_1_8 + var_1_9))))) && (var_1_10 == ((unsigned char) (var_1_11 && (var_1_21 || var_1_13))))) && ((var_1_8 <= ((((var_1_4) > ((var_1_1 + var_1_5))) ? (var_1_4) : ((var_1_1 + var_1_5))))) ? (var_1_10 ? (var_1_14 == ((signed long int) (var_1_15 + (8 + var_1_16)))) : (var_1_14 == ((signed long int) -256))) : (var_1_14 == ((signed long int) var_1_16)))) && ((var_1_8 <= (((((var_1_5 * 1.25)) > ((last_1_var_1_7 * var_1_9))) ? ((var_1_5 * 1.25)) : ((last_1_var_1_7 * var_1_9))))) ? (var_1_16 == ((signed long int) ((((((last_1_var_1_23) < 0 ) ? -(last_1_var_1_23) : (last_1_var_1_23))) + last_1_var_1_23) + ((var_1_17 - var_1_18) - ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))))) : ((var_1_4 <= last_1_var_1_7) ? (var_1_16 == ((signed long int) var_1_17)) : 1))) && ((((50 / -10) + var_1_23) >= var_1_16) ? (var_1_13 ? (var_1_21 == ((unsigned char) (var_1_11 && var_1_22))) : (var_1_21 == ((unsigned char) var_1_11))) : (var_1_21 == ((unsigned char) var_1_11)))) && (var_1_23 == ((signed long int) last_1_var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=0, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 88 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 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:48:46,028 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-82.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 a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:48:47,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:48:47,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:48:47,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:48:47,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:48:47,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:48:47,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:48:47,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:48:47,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:48:47,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:48:47,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:48:47,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:48:47,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:48:47,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:48:47,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:48:47,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:48:47,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:48:47,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:48:47,912 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 -> a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 [2025-03-08 14:48:48,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:48:48,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:48:48,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:48:48,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:48:48,161 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:48:48,163 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-82.i [2025-03-08 14:48:49,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf4498e1/913981e51801435d82801aa9871f7dd7/FLAG4bf43b00e [2025-03-08 14:48:49,532 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:48:49,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2025-03-08 14:48:49,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf4498e1/913981e51801435d82801aa9871f7dd7/FLAG4bf43b00e [2025-03-08 14:48:49,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf4498e1/913981e51801435d82801aa9871f7dd7 [2025-03-08 14:48:49,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:48:49,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:48:49,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:48:49,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:48:49,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:48:49,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:48:49" (1/1) ... [2025-03-08 14:48:49,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f31ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:49, skipping insertion in model container [2025-03-08 14:48:49,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:48:49" (1/1) ... [2025-03-08 14:48:49,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:48:50,027 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-82.i[915,928] [2025-03-08 14:48:50,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:48:50,094 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:48:50,101 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-82.i[915,928] [2025-03-08 14:48:50,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:48:50,131 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:48:50,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50 WrapperNode [2025-03-08 14:48:50,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:48:50,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:48:50,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:48:50,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:48:50,137 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:48:50" (1/1) ... [2025-03-08 14:48:50,147 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:48:50" (1/1) ... [2025-03-08 14:48:50,164 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-03-08 14:48:50,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:48:50,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:48:50,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:48:50,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:48:50,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,184 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:48:50,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:48:50,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:48:50,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:48:50,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:48:50,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (1/1) ... [2025-03-08 14:48:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:48:50,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:48:50,226 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:48:50,228 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:48:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:48:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:48:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:48:50,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:48:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:48:50,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:48:50,310 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:48:50,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:49:04,262 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:49:04,262 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:49:04,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:49:04,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:49:04,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:04 BoogieIcfgContainer [2025-03-08 14:49:04,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:49:04,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:49:04,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:49:04,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:49:04,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:48:49" (1/3) ... [2025-03-08 14:49:04,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3722371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:49:04, skipping insertion in model container [2025-03-08 14:49:04,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:48:50" (2/3) ... [2025-03-08 14:49:04,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3722371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:49:04, skipping insertion in model container [2025-03-08 14:49:04,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:04" (3/3) ... [2025-03-08 14:49:04,276 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-82.i [2025-03-08 14:49:04,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:49:04,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-82.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:49:04,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:49:04,356 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;@266fcfed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:49:04,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:49:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:49:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 14:49:04,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:04,370 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:49:04,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:04,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash 688523504, now seen corresponding path program 1 times [2025-03-08 14:49:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:49:04,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171952989] [2025-03-08 14:49:04,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:04,384 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:49:04,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:49:04,386 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:49:04,389 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:49:04,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 14:49:04,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 14:49:04,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:04,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:04,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:49:04,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:49:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 14:49:04,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:49:04,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:49:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171952989] [2025-03-08 14:49:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171952989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:49:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:49:04,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:49:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21800210] [2025-03-08 14:49:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:49:04,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:49:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:49:05,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:49:05,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:49:05,008 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:49:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:49:05,028 INFO L93 Difference]: Finished difference Result 119 states and 197 transitions. [2025-03-08 14:49:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:49:05,029 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-08 14:49:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:49:05,035 INFO L225 Difference]: With dead ends: 119 [2025-03-08 14:49:05,036 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 14:49:05,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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:49:05,040 INFO L435 NwaCegarLoop]: 88 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, 88 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:49:05,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:49:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 14:49:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 14:49:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:49:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-08 14:49:05,064 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 128 [2025-03-08 14:49:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:49:05,064 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-08 14:49:05,064 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:49:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-08 14:49:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 14:49:05,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:49:05,066 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:49:05,085 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:49:05,266 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:49:05,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:49:05,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:49:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash 544487796, now seen corresponding path program 1 times [2025-03-08 14:49:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:49:05,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988686387] [2025-03-08 14:49:05,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:49:05,268 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:49:05,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:49:05,270 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:49:05,271 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:49:05,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 14:49:06,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 14:49:06,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:49:06,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:49:06,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 14:49:06,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:49:58,395 WARN L286 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 14:50:06,598 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:50:13,158 WARN L286 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 11 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:50:21,397 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)