./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-45.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-45.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 509571b928f0e2dfbb1c09fe2b4934eac01a43200c8a3311413a2cff66ec306f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:39:37,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:39:37,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:39:37,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:39:37,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:39:37,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:39:37,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:39:37,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:39:37,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:39:37,705 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:39:37,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:39:37,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:39:37,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:39:37,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:39:37,706 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:39:37,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:39:37,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:39:37,708 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:39:37,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:39:37,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:39:37,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:39:37,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:39:37,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:39:37,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:39:37,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:39:37,710 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:39:37,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:39:37,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:39:37,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:39:37,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:39:37,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:39:37,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:39:37,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:39:37,711 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 -> 509571b928f0e2dfbb1c09fe2b4934eac01a43200c8a3311413a2cff66ec306f [2025-03-17 03:39:37,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:39:37,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:39:37,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:39:37,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:39:37,933 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:39:37,934 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-45.i [2025-03-17 03:39:39,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ace745c/224fefff24a64fe6917e38c8677a719d/FLAG8be09e2ff [2025-03-17 03:39:39,282 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:39:39,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-45.i [2025-03-17 03:39:39,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ace745c/224fefff24a64fe6917e38c8677a719d/FLAG8be09e2ff [2025-03-17 03:39:39,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ace745c/224fefff24a64fe6917e38c8677a719d [2025-03-17 03:39:39,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:39:39,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:39:39,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:39:39,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:39:39,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:39:39,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39, skipping insertion in model container [2025-03-17 03:39:39,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:39:39,425 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-45.i[915,928] [2025-03-17 03:39:39,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:39:39,475 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:39:39,483 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-45.i[915,928] [2025-03-17 03:39:39,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:39:39,520 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:39:39,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39 WrapperNode [2025-03-17 03:39:39,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:39:39,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:39:39,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:39:39,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:39:39,528 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:39:39" (1/1) ... [2025-03-17 03:39:39,536 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:39:39" (1/1) ... [2025-03-17 03:39:39,563 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-17 03:39:39,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:39:39,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:39:39,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:39:39,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:39:39,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,587 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:39:39,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:39:39,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:39:39,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:39:39,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:39:39,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (1/1) ... [2025-03-17 03:39:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:39:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:39:39,630 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:39:39,632 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:39:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:39:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:39:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:39:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:39:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:39:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:39:39,695 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:39:39,697 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:39:39,849 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:39:39,850 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:39:39,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:39:39,856 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:39:39,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:39:39 BoogieIcfgContainer [2025-03-17 03:39:39,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:39:39,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:39:39,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:39:39,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:39:39,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:39:39" (1/3) ... [2025-03-17 03:39:39,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1a1e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:39:39, skipping insertion in model container [2025-03-17 03:39:39,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:39" (2/3) ... [2025-03-17 03:39:39,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1a1e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:39:39, skipping insertion in model container [2025-03-17 03:39:39,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:39:39" (3/3) ... [2025-03-17 03:39:39,863 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-45.i [2025-03-17 03:39:39,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:39:39,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-45.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:39:39,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:39:39,924 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;@24272bd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:39:39,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:39:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:39:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:39:39,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:39:39,938 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:39:39,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:39:39,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:39:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1188823873, now seen corresponding path program 1 times [2025-03-17 03:39:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:39:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908870496] [2025-03-17 03:39:39,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:39:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:39:40,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:40,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:40,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:40,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:39:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 03:39:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:39:40,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908870496] [2025-03-17 03:39:40,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908870496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:39:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669528318] [2025-03-17 03:39:40,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:39:40,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:39:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:39:40,163 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:39:40,164 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:39:40,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:40,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:40,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:40,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:39:40,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:39:40,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:39:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 03:39:40,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:39:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669528318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:39:40,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:39:40,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:39:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982419115] [2025-03-17 03:39:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:39:40,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:39:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:39:40,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:39:40,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:39:40,330 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:39:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:39:40,350 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2025-03-17 03:39:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:39:40,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2025-03-17 03:39:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:39:40,355 INFO L225 Difference]: With dead ends: 93 [2025-03-17 03:39:40,356 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 03:39:40,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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:39:40,361 INFO L435 NwaCegarLoop]: 68 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, 68 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:39:40,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:39:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 03:39:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 03:39:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:39:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2025-03-17 03:39:40,391 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 115 [2025-03-17 03:39:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:39:40,391 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2025-03-17 03:39:40,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:39:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2025-03-17 03:39:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:39:40,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:39:40,394 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:39:40,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:39:40,595 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:39:40,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:39:40,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:39:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash 70052932, now seen corresponding path program 1 times [2025-03-17 03:39:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:39:40,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248741888] [2025-03-17 03:39:40,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:39:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:39:40,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:40,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:40,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:40,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:39:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 60 proven. 120 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-17 03:39:45,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:39:45,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248741888] [2025-03-17 03:39:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248741888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:39:45,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438685752] [2025-03-17 03:39:45,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:39:45,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:39:45,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:39:45,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:39:45,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:39:45,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:45,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:45,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:39:45,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 03:39:45,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:39:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 339 proven. 120 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 03:39:46,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:39:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 99 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-03-17 03:39:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438685752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:39:47,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:39:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 12] total 30 [2025-03-17 03:39:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739958553] [2025-03-17 03:39:47,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:39:47,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 03:39:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:39:47,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 03:39:47,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2025-03-17 03:39:47,514 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 30 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2025-03-17 03:39:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:39:50,966 INFO L93 Difference]: Finished difference Result 219 states and 289 transitions. [2025-03-17 03:39:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 03:39:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 115 [2025-03-17 03:39:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:39:50,968 INFO L225 Difference]: With dead ends: 219 [2025-03-17 03:39:50,968 INFO L226 Difference]: Without dead ends: 174 [2025-03-17 03:39:50,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1138, Invalid=3022, Unknown=0, NotChecked=0, Total=4160 [2025-03-17 03:39:50,971 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 198 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:39:50,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 391 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:39:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-17 03:39:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2025-03-17 03:39:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 87 states have internal predecessors, (98), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 03:39:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2025-03-17 03:39:51,012 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 115 [2025-03-17 03:39:51,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:39:51,012 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2025-03-17 03:39:51,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2025-03-17 03:39:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2025-03-17 03:39:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:39:51,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:39:51,015 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:39:51,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:39:51,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 03:39:51,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:39:51,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:39:51,217 INFO L85 PathProgramCache]: Analyzing trace with hash 70082723, now seen corresponding path program 1 times [2025-03-17 03:39:51,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:39:51,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603276118] [2025-03-17 03:39:51,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:39:51,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:39:51,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:51,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:51,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:51,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:39:51,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:39:51,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:51,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:51,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:51,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:39:51,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:39:51,382 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:39:51,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:39:51,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:39:51,388 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:39:51,454 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:39:51,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:39:51 BoogieIcfgContainer [2025-03-17 03:39:51,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:39:51,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:39:51,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:39:51,458 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:39:51,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:39:39" (3/4) ... [2025-03-17 03:39:51,460 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:39:51,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:39:51,462 INFO L158 Benchmark]: Toolchain (without parser) took 12153.82ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 122.5MB in the beginning and 248.7MB in the end (delta: -126.2MB). Peak memory consumption was 184.2MB. Max. memory is 16.1GB. [2025-03-17 03:39:51,462 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:39:51,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.22ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 110.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:39:51,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.17ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 107.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:39:51,463 INFO L158 Benchmark]: Boogie Preprocessor took 36.86ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:39:51,463 INFO L158 Benchmark]: IcfgBuilder took 251.47ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 89.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:39:51,463 INFO L158 Benchmark]: TraceAbstraction took 11598.57ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 89.2MB in the beginning and 252.9MB in the end (delta: -163.7MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2025-03-17 03:39:51,463 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 478.2MB. Free memory was 252.9MB in the beginning and 248.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:39:51,464 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.22ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 110.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.17ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 107.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.86ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 251.47ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 89.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11598.57ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 89.2MB in the beginning and 252.9MB in the end (delta: -163.7MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 478.2MB. Free memory was 252.9MB in the beginning and 248.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 999999.2; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 5.9; [L25] double var_1_8 = 255.6; [L26] unsigned long int var_1_9 = 4; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 1142722175; [L29] unsigned long int var_1_12 = 1231257437; [L30] signed char var_1_13 = -10; [L31] signed char var_1_14 = 100; [L32] signed char var_1_15 = 4; [L33] signed char var_1_16 = 64; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = -8; [L36] unsigned char var_1_19 = 4; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L59] var_1_6 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L60] RET assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L61] var_1_7 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L62] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L63] var_1_8 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L64] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L65] var_1_10 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L66] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L67] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L68] var_1_11 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L69] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L70] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L70] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L71] var_1_12 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L72] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L73] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L73] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L74] var_1_14 = __VERIFIER_nondet_char() [L75] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L75] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L76] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L76] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L77] var_1_15 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L78] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L79] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L79] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L80] var_1_16 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L81] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L82] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L82] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L83] var_1_17 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L84] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L85] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L85] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L86] var_1_18 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L101] RET updateVariables() [L102] CALL step() [L40] COND TRUE \read(var_1_10) [L41] var_1_9 = ((var_1_11 + var_1_12) - 5u) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=-2147483654] [L43] var_1_19 = var_1_16 [L44] unsigned long int stepLocal_0 = ((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)); VAL [isInitial=1, stepLocal_0=-2147483654, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-10, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=52, var_1_1=4999996/5, var_1_9=-2147483654] [L45] COND TRUE \read(var_1_10) [L46] var_1_13 = (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))) VAL [isInitial=1, stepLocal_0=-2147483654, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-51, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=52, var_1_1=4999996/5, var_1_9=-2147483654] [L52] COND FALSE !((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) [L55] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=-2147483654, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-51, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=52, var_1_1=1231257442, var_1_6=1231257442, var_1_9=-2147483654] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return (((((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) ? (var_1_1 == ((double) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((double) var_1_6))) && (var_1_10 ? (var_1_9 == ((unsigned long int) ((var_1_11 + var_1_12) - 5u))) : 1)) && (var_1_10 ? (var_1_13 == ((signed char) (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))))) : ((var_1_12 < (((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)))) ? (var_1_13 == ((signed char) (var_1_17 + var_1_18))) : 1))) && (var_1_19 == ((unsigned char) var_1_16)) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-51, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=52, var_1_1=1231257442, var_1_6=1231257442, var_1_9=-2147483654] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1073741823, var_1_12=-3221225472, var_1_13=-51, var_1_14=-1, var_1_15=51, var_1_16=52, var_1_17=-63, var_1_18=62, var_1_19=52, var_1_1=1231257442, var_1_6=1231257442, var_1_9=-2147483654] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 91 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 203 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 459 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 776 IncrementalHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 144 mSDtfsCounter, 776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=2, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 570 ConstructedInterpolants, 3 QuantifiedInterpolants, 3670 SizeOfPredicates, 8 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3045/3420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:39:51,488 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-45.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 509571b928f0e2dfbb1c09fe2b4934eac01a43200c8a3311413a2cff66ec306f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:39:53,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:39:53,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:39:53,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:39:53,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:39:53,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:39:53,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:39:53,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:39:53,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:39:53,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:39:53,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:39:53,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:39:53,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:39:53,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:39:53,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:39:53,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:39:53,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:39:53,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:39:53,465 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 -> 509571b928f0e2dfbb1c09fe2b4934eac01a43200c8a3311413a2cff66ec306f [2025-03-17 03:39:53,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:39:53,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:39:53,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:39:53,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:39:53,741 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:39:53,741 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-45.i [2025-03-17 03:39:54,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fac53606/14a69055c34c474dace9a6a2f39a62b5/FLAG8b28abb3c [2025-03-17 03:39:55,089 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:39:55,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-45.i [2025-03-17 03:39:55,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fac53606/14a69055c34c474dace9a6a2f39a62b5/FLAG8b28abb3c [2025-03-17 03:39:55,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fac53606/14a69055c34c474dace9a6a2f39a62b5 [2025-03-17 03:39:55,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:39:55,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:39:55,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:39:55,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:39:55,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:39:55,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302bd6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55, skipping insertion in model container [2025-03-17 03:39:55,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:39:55,562 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-45.i[915,928] [2025-03-17 03:39:55,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:39:55,622 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:39:55,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-45.i[915,928] [2025-03-17 03:39:55,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:39:55,667 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:39:55,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55 WrapperNode [2025-03-17 03:39:55,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:39:55,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:39:55,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:39:55,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:39:55,674 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:39:55" (1/1) ... [2025-03-17 03:39:55,680 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:39:55" (1/1) ... [2025-03-17 03:39:55,699 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-17 03:39:55,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:39:55,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:39:55,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:39:55,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:39:55,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,714 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:39:55,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:39:55,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:39:55,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:39:55,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:39:55,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (1/1) ... [2025-03-17 03:39:55,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:39:55,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:39:55,751 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:39:55,753 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:39:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:39:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:39:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:39:55,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:39:55,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:39:55,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:39:55,818 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:39:55,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:39:58,106 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:39:58,106 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:39:58,114 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:39:58,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:39:58,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:39:58 BoogieIcfgContainer [2025-03-17 03:39:58,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:39:58,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:39:58,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:39:58,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:39:58,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:39:55" (1/3) ... [2025-03-17 03:39:58,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409a7099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:39:58, skipping insertion in model container [2025-03-17 03:39:58,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:55" (2/3) ... [2025-03-17 03:39:58,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409a7099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:39:58, skipping insertion in model container [2025-03-17 03:39:58,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:39:58" (3/3) ... [2025-03-17 03:39:58,122 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-45.i [2025-03-17 03:39:58,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:39:58,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-45.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:39:58,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:39:58,173 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;@455dc92d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:39:58,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:39:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:39:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:39:58,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:39:58,185 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:39:58,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:39:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:39:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1188823873, now seen corresponding path program 1 times [2025-03-17 03:39:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:39:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139572278] [2025-03-17 03:39:58,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:39:58,196 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:39:58,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:39:58,199 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:39:58,200 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:39:58,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:58,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:58,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:58,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:39:58,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:39:58,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:39:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 03:39:58,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:39:58,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:39:58,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139572278] [2025-03-17 03:39:58,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139572278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:39:58,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:39:58,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:39:58,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741435516] [2025-03-17 03:39:58,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:39:58,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:39:58,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:39:58,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:39:58,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:39:58,475 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:39:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:39:58,497 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2025-03-17 03:39:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:39:58,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2025-03-17 03:39:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:39:58,516 INFO L225 Difference]: With dead ends: 93 [2025-03-17 03:39:58,517 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 03:39:58,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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:39:58,523 INFO L435 NwaCegarLoop]: 68 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, 68 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:39:58,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:39:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 03:39:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 03:39:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:39:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2025-03-17 03:39:58,555 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 115 [2025-03-17 03:39:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:39:58,555 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2025-03-17 03:39:58,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:39:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2025-03-17 03:39:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:39:58,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:39:58,559 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:39:58,568 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:39:58,759 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:39:58,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:39:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:39:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash 70052932, now seen corresponding path program 1 times [2025-03-17 03:39:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:39:58,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956026266] [2025-03-17 03:39:58,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:39:58,762 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:39:58,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:39:58,764 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:39:58,764 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:39:58,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:58,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:58,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:58,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:39:59,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 03:39:59,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:40:45,873 WARN L286 SmtUtils]: Spent 11.78s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)