./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.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 ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:36:55,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:36:55,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:36:55,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:36:55,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:36:55,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:36:55,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:36:55,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:36:55,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:36:55,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:36:55,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:36:55,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:36:55,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:36:55,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:36:55,562 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:36:55,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:36:55,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:36:55,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:36:55,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:36:55,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:36:55,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:36:55,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:36:55,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:36:55,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:36:55,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:36:55,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:36:55,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:36:55,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:36:55,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:36:55,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:55,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:36:55,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:36:55,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:36:55,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:36:55,566 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 -> ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b [2025-03-17 03:36:55,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:36:55,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:36:55,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:36:55,848 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:36:55,849 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:36:55,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-17 03:36:57,113 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3fe3649/c17379eaa47f469cb8939345f4529611/FLAGf02740b79 [2025-03-17 03:36:57,422 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:36:57,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-17 03:36:57,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3fe3649/c17379eaa47f469cb8939345f4529611/FLAGf02740b79 [2025-03-17 03:36:57,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3fe3649/c17379eaa47f469cb8939345f4529611 [2025-03-17 03:36:57,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:36:57,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:36:57,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:57,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:36:57,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:36:57,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27901385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57, skipping insertion in model container [2025-03-17 03:36:57,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:36:57,632 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_25-while_file-26.i[915,928] [2025-03-17 03:36:57,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:57,681 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:36:57,694 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_25-while_file-26.i[915,928] [2025-03-17 03:36:57,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:57,740 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:36:57,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57 WrapperNode [2025-03-17 03:36:57,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:57,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:57,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:36:57,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:36:57,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,795 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2025-03-17 03:36:57,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:57,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:36:57,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:36:57,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:36:57,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,845 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:36:57,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:36:57,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:36:57,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:36:57,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:36:57,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (1/1) ... [2025-03-17 03:36:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:57,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:57,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:36:57,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:36:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:36:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:36:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:36:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:36:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:36:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:36:57,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:36:58,000 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:36:58,208 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:36:58,208 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:36:58,215 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:36:58,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:36:58,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:58 BoogieIcfgContainer [2025-03-17 03:36:58,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:36:58,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:36:58,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:36:58,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:36:58,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:36:57" (1/3) ... [2025-03-17 03:36:58,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5426a4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:58, skipping insertion in model container [2025-03-17 03:36:58,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:57" (2/3) ... [2025-03-17 03:36:58,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5426a4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:58, skipping insertion in model container [2025-03-17 03:36:58,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:58" (3/3) ... [2025-03-17 03:36:58,226 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-17 03:36:58,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:36:58,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-26.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:36:58,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:36:58,305 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;@5b6adf84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:36:58,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:36:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 03:36:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:36:58,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:58,320 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:58,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:58,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1455052884, now seen corresponding path program 1 times [2025-03-17 03:36:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:58,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123704018] [2025-03-17 03:36:58,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:58,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:36:58,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:36:58,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:58,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 03:36:58,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:58,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123704018] [2025-03-17 03:36:58,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123704018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:58,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247915761] [2025-03-17 03:36:58,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:58,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:58,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:58,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:36:58,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:36:58,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:36:58,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:36:58,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:58,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:58,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:36:58,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 03:36:58,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:58,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247915761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:58,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:36:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:36:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385685046] [2025-03-17 03:36:58,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:58,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:36:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:58,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:36:58,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:58,774 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 03:36:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:58,789 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2025-03-17 03:36:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:36:58,791 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 103 [2025-03-17 03:36:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:58,795 INFO L225 Difference]: With dead ends: 89 [2025-03-17 03:36:58,795 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 03:36:58,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:58,800 INFO L435 NwaCegarLoop]: 65 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, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:58,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 03:36:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 03:36:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 03:36:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2025-03-17 03:36:58,830 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 103 [2025-03-17 03:36:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:58,830 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 03:36:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 03:36:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2025-03-17 03:36:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:36:58,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:58,833 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:58,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:36:59,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:36:59,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:59,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash 362627279, now seen corresponding path program 1 times [2025-03-17 03:36:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:59,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084954952] [2025-03-17 03:36:59,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:59,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:36:59,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:36:59,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:36:59,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:36:59,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:36:59,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:36:59,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:59,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:36:59,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:36:59,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:36:59,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:36:59,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:36:59,265 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:36:59,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:36:59,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:36:59 BoogieIcfgContainer [2025-03-17 03:36:59,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:36:59,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:36:59,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:36:59,329 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:36:59,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:58" (3/4) ... [2025-03-17 03:36:59,331 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:36:59,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:36:59,333 INFO L158 Benchmark]: Toolchain (without parser) took 1867.00ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 93.2MB in the end (delta: 19.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2025-03-17 03:36:59,333 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:59,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.75ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:36:59,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.31ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 97.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:36:59,334 INFO L158 Benchmark]: Boogie Preprocessor took 70.37ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:59,334 INFO L158 Benchmark]: IcfgBuilder took 344.48ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 81.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:36:59,335 INFO L158 Benchmark]: TraceAbstraction took 1109.60ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 94.0MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:59,335 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.2MB in the end (delta: 800.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:36:59,336 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.51ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.75ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.31ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 97.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.37ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 344.48ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 81.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1109.60ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 94.0MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.2MB in the end (delta: 800.4kB). Peak memory consumption was 8.4MB. 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 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] signed short int var_1_4 = 1; [L24] signed short int var_1_5 = -10; [L25] double var_1_6 = 10.4; [L26] double var_1_7 = 100000000000000.2; [L27] double var_1_8 = 99.4; [L28] double var_1_9 = 49.825; [L29] unsigned short int var_1_10 = 50; [L30] unsigned char var_1_11 = 0; [L31] double var_1_12 = 4.3; [L32] double var_1_13 = 2.875; [L33] unsigned short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 50; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L61] var_1_4 = __VERIFIER_nondet_short() [L62] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L62] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L63] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L63] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=-10, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L65] RET assume_abort_if_not(var_1_5 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L66] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L66] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_7=500000000000001/5, var_1_8=497/5, var_1_9=1993/40] [L67] var_1_7 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L68] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_8=497/5, var_1_9=1993/40] [L69] var_1_8 = __VERIFIER_nondet_double() [L70] 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, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_9=1993/40] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_9=1993/40] [L70] 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, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5, var_1_9=1993/40] [L71] var_1_9 = __VERIFIER_nondet_double() [L72] 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, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L72] 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, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L74] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=50, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L75] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L75] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_12=43/10, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L76] var_1_12 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L77] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L78] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L78] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_13=23/8, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L79] var_1_13 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L80] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L81] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L81] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=64, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L82] var_1_14 = __VERIFIER_nondet_ushort() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L84] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L84] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L85] var_1_15 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L87] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L87] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=-1, var_1_4=32766, var_1_5=32765, var_1_6=52/5] [L100] RET updateVariables() [L101] CALL step() [L38] var_1_6 = (var_1_7 - (var_1_8 + var_1_9)) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=-1, var_1_4=32766, var_1_5=32765] [L39] COND TRUE var_1_6 > var_1_6 [L40] var_1_1 = ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=32766, var_1_4=32766, var_1_5=32765] [L44] signed long int stepLocal_1 = 100; [L45] unsigned char stepLocal_0 = var_1_8 <= (var_1_7 + var_1_9); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=100, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=32766, var_1_4=32766, var_1_5=32765] [L46] COND FALSE !(var_1_11 || stepLocal_0) VAL [isInitial=1, stepLocal_1=100, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=32766, var_1_4=32766, var_1_5=32765] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_6 > var_1_6) ? (var_1_1 == ((signed short int) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : (var_1_1 == ((signed short int) ((((-4) < (var_1_5)) ? (-4) : (var_1_5)))))) && (var_1_6 == ((double) (var_1_7 - (var_1_8 + var_1_9))))) && ((var_1_11 || (var_1_8 <= (var_1_7 + var_1_9))) ? ((((var_1_7 + var_1_6) / ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))) <= var_1_9) ? ((var_1_6 > 2.5) ? ((100 > var_1_1) ? (var_1_10 == ((unsigned short int) var_1_14)) : (var_1_10 == ((unsigned short int) var_1_15))) : (var_1_10 == ((unsigned short int) var_1_14))) : 1) : 1) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=32766, var_1_4=32766, var_1_5=32765] [L19] reach_error() VAL [isInitial=1, var_1_10=50, var_1_11=0, var_1_14=50, var_1_15=0, var_1_1=32766, var_1_4=32766, var_1_5=32765] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 86 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 17, 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, 65 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, 65 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred 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, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:36:59,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_25-while_file-26.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 ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:37:01,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:37:01,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:37:01,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:37:01,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:37:01,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:37:01,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:37:01,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:37:01,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:37:01,722 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:37:01,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:37:01,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:37:01,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:37:01,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:37:01,723 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:37:01,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:37:01,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:37:01,723 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:37:01,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:37:01,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:37:01,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:37:01,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:37:01,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:37:01,724 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:37:01,724 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:37:01,724 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:37:01,724 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:37:01,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:37:01,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:37:01,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:37:01,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:37:01,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:37:01,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:37:01,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:37:01,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:37:01,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:37:01,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:37:01,726 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 -> ddce48067b4423a9dbd4ae41b2384910d5e8f4f139aef66a78ce087435d0c23b [2025-03-17 03:37:02,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:37:02,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:37:02,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:37:02,023 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:37:02,023 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:37:02,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-17 03:37:03,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2488f08d3/898ce40b8c614d5394eb623b25978d0f/FLAGa69dbef77 [2025-03-17 03:37:03,592 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:37:03,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-17 03:37:03,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2488f08d3/898ce40b8c614d5394eb623b25978d0f/FLAGa69dbef77 [2025-03-17 03:37:03,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2488f08d3/898ce40b8c614d5394eb623b25978d0f [2025-03-17 03:37:03,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:37:03,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:37:03,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:37:03,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:37:03,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:37:03,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31720a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03, skipping insertion in model container [2025-03-17 03:37:03,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:37:03,755 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_25-while_file-26.i[915,928] [2025-03-17 03:37:03,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:37:03,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:37:03,832 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_25-while_file-26.i[915,928] [2025-03-17 03:37:03,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:37:03,875 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:37:03,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03 WrapperNode [2025-03-17 03:37:03,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:37:03,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:37:03,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:37:03,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:37:03,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,916 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-17 03:37:03,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:37:03,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:37:03,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:37:03,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:37:03,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:37:03,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:37:03,973 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:37:03,973 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:37:03,973 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:37:03,978 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (1/1) ... [2025-03-17 03:37:03,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:37:03,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:37:04,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:37:04,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:37:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:37:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:37:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:37:04,112 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:37:04,114 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:37:18,793 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:37:18,793 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:37:18,802 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:37:18,802 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:37:18,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:37:18 BoogieIcfgContainer [2025-03-17 03:37:18,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:37:18,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:37:18,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:37:18,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:37:18,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:37:03" (1/3) ... [2025-03-17 03:37:18,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7145ab4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:37:18, skipping insertion in model container [2025-03-17 03:37:18,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:03" (2/3) ... [2025-03-17 03:37:18,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7145ab4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:37:18, skipping insertion in model container [2025-03-17 03:37:18,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:37:18" (3/3) ... [2025-03-17 03:37:18,812 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-26.i [2025-03-17 03:37:18,825 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:37:18,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-26.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:37:18,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:37:18,887 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;@4bcc4549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:37:18,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:37:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 03:37:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:37:18,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:18,900 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:37:18,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:18,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1455052884, now seen corresponding path program 1 times [2025-03-17 03:37:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:37:18,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968591195] [2025-03-17 03:37:18,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:18,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:37:18,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:37:18,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:37:18,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:37:18,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:37:19,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:37:19,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:19,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:20,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:37:20,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:37:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 03:37:20,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:37:20,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:37:20,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968591195] [2025-03-17 03:37:20,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968591195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:20,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:37:20,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:37:20,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532326742] [2025-03-17 03:37:20,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:20,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:37:20,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:37:20,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:37:20,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:37:20,057 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 03:37:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:20,078 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2025-03-17 03:37:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:37:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 103 [2025-03-17 03:37:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:20,084 INFO L225 Difference]: With dead ends: 89 [2025-03-17 03:37:20,084 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 03:37:20,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:37:20,089 INFO L435 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:20,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:37:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 03:37:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 03:37:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 03:37:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2025-03-17 03:37:20,143 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 103 [2025-03-17 03:37:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:20,144 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-17 03:37:20,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 03:37:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2025-03-17 03:37:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:37:20,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:20,148 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:37:20,177 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-17 03:37:20,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:37:20,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:20,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash 391256430, now seen corresponding path program 1 times [2025-03-17 03:37:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:37:20,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208801859] [2025-03-17 03:37:20,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:20,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:37:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:37:20,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:37:20,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:37:20,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:37:21,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:37:21,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:21,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:21,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 03:37:21,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:09,372 WARN L286 SmtUtils]: Spent 10.97s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)