./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.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-28.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 bd298ce534de00beea346fb305edb551963d6d5842d9344f8b63a23a6d900658 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:37:14,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:37:14,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:37:14,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:37:14,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:37:14,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:37:14,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:37:14,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:37:14,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:37:14,736 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:37:14,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:37:14,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:37:14,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:37:14,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:37:14,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:37:14,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:37:14,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:37:14,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:37:14,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:37:14,742 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 -> bd298ce534de00beea346fb305edb551963d6d5842d9344f8b63a23a6d900658 [2025-03-17 03:37:15,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:37:15,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:37:15,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:37:15,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:37:15,016 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:37:15,018 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-28.i [2025-03-17 03:37:16,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2a008c3/1883fa6d28b14890b4ad497943ff480b/FLAG6d67b518c [2025-03-17 03:37:16,547 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:37:16,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.i [2025-03-17 03:37:16,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2a008c3/1883fa6d28b14890b4ad497943ff480b/FLAG6d67b518c [2025-03-17 03:37:16,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2a008c3/1883fa6d28b14890b4ad497943ff480b [2025-03-17 03:37:16,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:37:16,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:37:16,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:37:16,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:37:16,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:37:16,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:37:16" (1/1) ... [2025-03-17 03:37:16,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce1139a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:16, skipping insertion in model container [2025-03-17 03:37:16,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:37:16" (1/1) ... [2025-03-17 03:37:16,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:37:16,749 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-28.i[915,928] [2025-03-17 03:37:16,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:37:16,813 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:37:16,821 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-28.i[915,928] [2025-03-17 03:37:16,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:37:16,863 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:37:16,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:16 WrapperNode [2025-03-17 03:37:16,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:37:16,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:37:16,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:37:16,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:37:16,872 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:16" (1/1) ... [2025-03-17 03:37:16,886 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:16" (1/1) ... [2025-03-17 03:37:16,912 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-17 03:37:16,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:37:16,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:37:16,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:37:16,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:37:16,920 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:16" (1/1) ... [2025-03-17 03:37:16,920 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:16" (1/1) ... [2025-03-17 03:37:16,922 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:16" (1/1) ... [2025-03-17 03:37:16,931 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:16,931 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:16" (1/1) ... [2025-03-17 03:37:16,931 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:16" (1/1) ... [2025-03-17 03:37:16,935 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:16" (1/1) ... [2025-03-17 03:37:16,936 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:16" (1/1) ... [2025-03-17 03:37:16,937 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:16" (1/1) ... [2025-03-17 03:37:16,937 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:16" (1/1) ... [2025-03-17 03:37:16,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:37:16,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:37:16,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:37:16,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:37:16,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:16" (1/1) ... [2025-03-17 03:37:16,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:37:16,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:37:16,977 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:16,982 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:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:37:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:37:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:37:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:37:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:37:17,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:37:17,065 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:37:17,066 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:37:17,217 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2025-03-17 03:37:17,239 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:37:17,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:37:17,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:37:17,257 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:37:17,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:37:17 BoogieIcfgContainer [2025-03-17 03:37:17,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:37:17,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:37:17,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:37:17,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:37:17,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:37:16" (1/3) ... [2025-03-17 03:37:17,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b950f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:37:17, skipping insertion in model container [2025-03-17 03:37:17,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:16" (2/3) ... [2025-03-17 03:37:17,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b950f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:37:17, skipping insertion in model container [2025-03-17 03:37:17,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:37:17" (3/3) ... [2025-03-17 03:37:17,267 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-28.i [2025-03-17 03:37:17,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:37:17,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-28.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:37:17,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:37:17,349 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;@43747aea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:37:17,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:37:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:37:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:37:17,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:17,369 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:17,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1245912538, now seen corresponding path program 1 times [2025-03-17 03:37:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:37:17,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060246491] [2025-03-17 03:37:17,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:37:17,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:37:17,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:37:17,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:17,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:37:17,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:37:17,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060246491] [2025-03-17 03:37:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060246491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:37:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263327964] [2025-03-17 03:37:17,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:17,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:37:17,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:37:17,643 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:37:17,651 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:37:17,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:37:17,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:37:17,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:17,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:17,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:37:17,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:37:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:37:17,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:37:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263327964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:17,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:37:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:37:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259674151] [2025-03-17 03:37:17,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:17,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:37:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:37:17,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:37:17,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:37:17,881 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:37:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:17,911 INFO L93 Difference]: Finished difference Result 103 states and 170 transitions. [2025-03-17 03:37:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:37:17,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-17 03:37:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:17,918 INFO L225 Difference]: With dead ends: 103 [2025-03-17 03:37:17,918 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 03:37:17,921 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:37:17,923 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:17,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:37:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 03:37:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 03:37:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:37:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2025-03-17 03:37:17,951 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 103 [2025-03-17 03:37:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:17,951 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2025-03-17 03:37:17,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:37:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2025-03-17 03:37:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:37:17,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:17,954 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:37:18,155 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:37:18,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1751934234, now seen corresponding path program 1 times [2025-03-17 03:37:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:37:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545029147] [2025-03-17 03:37:18,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:37:18,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:37:18,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:37:18,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:18,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:37:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:37:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545029147] [2025-03-17 03:37:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545029147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:18,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:37:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:37:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329278149] [2025-03-17 03:37:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:18,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:37:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:37:18,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:37:18,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:37:18,480 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:37:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:18,554 INFO L93 Difference]: Finished difference Result 131 states and 181 transitions. [2025-03-17 03:37:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:37:18,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-17 03:37:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:18,559 INFO L225 Difference]: With dead ends: 131 [2025-03-17 03:37:18,559 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 03:37:18,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:37:18,561 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 60 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:37:18,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 149 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:37:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 03:37:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-17 03:37:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.2) internal successors, (66), 56 states have internal predecessors, (66), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 03:37:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2025-03-17 03:37:18,569 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 103 [2025-03-17 03:37:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:18,573 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2025-03-17 03:37:18,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:37:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2025-03-17 03:37:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:37:18,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:18,574 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:37:18,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:18,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash 45017125, now seen corresponding path program 1 times [2025-03-17 03:37:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:37:18,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440468575] [2025-03-17 03:37:18,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:37:18,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:37:18,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:37:18,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:18,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:37:18,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:37:18,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:37:18,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:37:18,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:18,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:37:18,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:37:18,750 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:37:18,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:37:18,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:37:18,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:37:18,813 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:37:18,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:37:18 BoogieIcfgContainer [2025-03-17 03:37:18,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:37:18,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:37:18,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:37:18,818 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:37:18,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:37:17" (3/4) ... [2025-03-17 03:37:18,821 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:37:18,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:37:18,823 INFO L158 Benchmark]: Toolchain (without parser) took 2245.46ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 54.1MB in the end (delta: 58.4MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2025-03-17 03:37:18,823 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:37:18,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.15ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:37:18,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.19ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:37:18,824 INFO L158 Benchmark]: Boogie Preprocessor took 25.55ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:37:18,825 INFO L158 Benchmark]: IcfgBuilder took 317.91ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 79.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:37:18,825 INFO L158 Benchmark]: TraceAbstraction took 1556.41ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 54.8MB in the end (delta: 24.4MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-03-17 03:37:18,825 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 142.6MB. Free memory was 54.8MB in the beginning and 54.1MB in the end (delta: 766.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:37:18,827 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.15ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.19ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.55ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.91ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 79.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1556.41ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 54.8MB in the end (delta: 24.4MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 142.6MB. Free memory was 54.8MB in the beginning and 54.1MB in the end (delta: 766.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 41, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] float var_1_2 = 63.75; [L24] float var_1_3 = 255.75; [L25] signed char var_1_5 = 10; [L26] signed char var_1_6 = 4; [L27] signed char var_1_7 = -10; [L28] float var_1_8 = 4.75; [L29] float var_1_9 = 99.5; [L30] float var_1_10 = 255.9; [L31] float var_1_11 = 24.85; [L32] signed long int var_1_12 = -2; [L33] signed long int var_1_13 = 1629954775; [L34] signed long int var_1_14 = 1; [L35] signed long int var_1_15 = 1928642731; [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L57] var_1_2 = __VERIFIER_nondet_float() [L58] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L58] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L59] var_1_3 = __VERIFIER_nondet_float() [L60] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L60] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L61] var_1_5 = __VERIFIER_nondet_char() [L62] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L62] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L63] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L63] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L64] var_1_6 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L66] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L66] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4, var_1_9=199/2] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4, var_1_9=199/2] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4, var_1_9=199/2] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4, var_1_9=199/2] [L70] var_1_9 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L71] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L72] var_1_10 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L73] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L74] var_1_13 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L75] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L76] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L76] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L77] var_1_14 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L78] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L79] CALL assume_abort_if_not(var_1_14 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L79] RET assume_abort_if_not(var_1_14 <= 1073741823) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1928642731, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L80] var_1_15 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L81] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L95] RET updateVariables() [L96] CALL step() [L39] signed long int stepLocal_0 = -4; VAL [isInitial=1, stepLocal_0=-4, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=19/4] [L40] COND TRUE stepLocal_0 < var_1_6 [L41] var_1_8 = ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, var_1_10=1928642736, var_1_11=497/20, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=1928642736, var_1_9=1928642736] [L43] var_1_11 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) [L44] signed long int stepLocal_1 = (((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)); VAL [isInitial=1, stepLocal_1=126, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=1928642736, var_1_9=1928642736] [L45] EXPR var_1_6 | 5 VAL [isInitial=1, stepLocal_1=126, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-2, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=1928642736, var_1_9=1928642736] [L45] COND TRUE (var_1_6 | 5) <= stepLocal_1 [L46] var_1_12 = (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741697, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=1928642736, var_1_9=1928642736] [L50] COND TRUE (var_1_2 - var_1_3) <= (- var_1_11) [L51] var_1_1 = (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741697, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=-127, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=1928642736, var_1_9=1928642736] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR (((((var_1_2 - var_1_3) <= (- var_1_11)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) 4))) VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741697, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=-127, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=1928642736, var_1_9=1928642736] [L87-L88] return (((((var_1_2 - var_1_3) <= (- var_1_11)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) 4))) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741697, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=-127, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=1928642736, var_1_9=1928642736] [L19] reach_error() VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741697, var_1_13=1073741823, var_1_14=1073741823, var_1_15=1073741823, var_1_1=-127, var_1_5=126, var_1_6=0, var_1_7=-127, var_1_8=1928642736, var_1_9=1928642736] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 94 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 163 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1410/1440 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:37:18,845 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-28.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 bd298ce534de00beea346fb305edb551963d6d5842d9344f8b63a23a6d900658 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:37:20,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:37:21,088 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:21,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:37:21,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:37:21,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:37:21,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:37:21,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:37:21,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:37:21,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:37:21,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:37:21,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:37:21,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:37:21,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:37:21,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:37:21,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:37:21,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:37:21,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:37:21,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:37:21,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:37:21,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:37:21,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:37:21,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:37:21,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:37:21,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:37:21,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:37:21,137 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 -> bd298ce534de00beea346fb305edb551963d6d5842d9344f8b63a23a6d900658 [2025-03-17 03:37:21,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:37:21,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:37:21,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:37:21,447 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:37:21,447 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:37:21,449 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-28.i [2025-03-17 03:37:22,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54489cea3/cebc40d3e65c413fb78ca7c032593218/FLAG4369efa80 [2025-03-17 03:37:23,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:37:23,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.i [2025-03-17 03:37:23,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54489cea3/cebc40d3e65c413fb78ca7c032593218/FLAG4369efa80 [2025-03-17 03:37:23,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54489cea3/cebc40d3e65c413fb78ca7c032593218 [2025-03-17 03:37:23,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:37:23,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:37:23,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:37:23,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:37:23,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:37:23,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:37:23" (1/1) ... [2025-03-17 03:37:23,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ed3e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:23, skipping insertion in model container [2025-03-17 03:37:23,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:37:23" (1/1) ... [2025-03-17 03:37:23,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:37:23,188 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-28.i[915,928] [2025-03-17 03:37:23,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:37:23,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:37:23,267 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-28.i[915,928] [2025-03-17 03:37:23,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:37:23,316 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:37:23,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:23 WrapperNode [2025-03-17 03:37:23,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:37:23,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:37:23,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:37:23,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:37:23,332 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:23" (1/1) ... [2025-03-17 03:37:23,346 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:23" (1/1) ... [2025-03-17 03:37:23,371 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-03-17 03:37:23,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:37:23,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:37:23,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:37:23,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:37:23,379 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:23" (1/1) ... [2025-03-17 03:37:23,379 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:23" (1/1) ... [2025-03-17 03:37:23,383 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:23" (1/1) ... [2025-03-17 03:37:23,391 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:23,392 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:23" (1/1) ... [2025-03-17 03:37:23,392 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:23" (1/1) ... [2025-03-17 03:37:23,397 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:23" (1/1) ... [2025-03-17 03:37:23,398 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:23" (1/1) ... [2025-03-17 03:37:23,400 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:23" (1/1) ... [2025-03-17 03:37:23,401 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:23" (1/1) ... [2025-03-17 03:37:23,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:37:23,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:37:23,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:37:23,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:37:23,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:23" (1/1) ... [2025-03-17 03:37:23,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:37:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:37:23,461 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:23,474 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:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:37:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:37:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:37:23,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:37:23,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:37:23,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:37:23,589 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:37:23,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:37:24,138 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:37:24,138 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:37:24,147 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:37:24,148 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:37:24,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:37:24 BoogieIcfgContainer [2025-03-17 03:37:24,148 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:37:24,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:37:24,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:37:24,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:37:24,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:37:23" (1/3) ... [2025-03-17 03:37:24,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbcdda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:37:24, skipping insertion in model container [2025-03-17 03:37:24,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:37:23" (2/3) ... [2025-03-17 03:37:24,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbcdda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:37:24, skipping insertion in model container [2025-03-17 03:37:24,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:37:24" (3/3) ... [2025-03-17 03:37:24,159 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-28.i [2025-03-17 03:37:24,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:37:24,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-28.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:37:24,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:37:24,232 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;@1fa60c40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:37:24,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:37:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:37:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:37:24,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:24,244 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:24,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -910829413, now seen corresponding path program 1 times [2025-03-17 03:37:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:37:24,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562956146] [2025-03-17 03:37:24,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:24,277 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:24,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:37:24,281 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:24,283 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:24,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:37:24,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:37:24,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:24,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:24,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:37:24,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:37:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-17 03:37:24,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:37:24,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:37:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562956146] [2025-03-17 03:37:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562956146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:37:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:37:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:37:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180498523] [2025-03-17 03:37:24,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:37:24,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:37:24,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:37:24,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:37:24,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:37:24,565 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:37:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:37:24,585 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2025-03-17 03:37:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:37:24,587 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2025-03-17 03:37:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:37:24,593 INFO L225 Difference]: With dead ends: 83 [2025-03-17 03:37:24,593 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 03:37:24,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:24,599 INFO L435 NwaCegarLoop]: 59 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, 59 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:24,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 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:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 03:37:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 03:37:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:37:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-17 03:37:24,636 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 99 [2025-03-17 03:37:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:37:24,636 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 03:37:24,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:37:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-03-17 03:37:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:37:24,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:37:24,639 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:37:24,840 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:24,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:37:24,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:37:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2135355739, now seen corresponding path program 1 times [2025-03-17 03:37:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:37:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508525327] [2025-03-17 03:37:24,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:37:24,842 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:24,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:37:24,845 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:24,847 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:24,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:37:25,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:37:25,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:37:25,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:37:25,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 03:37:25,102 INFO L279 TraceCheckSpWp]: Computing forward predicates...