./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.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-1loop_file-39.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 cad39411d7becf64b0716e48fab4680fd039796e30818af24b0de5905de7c645 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:27:37,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:27:37,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:27:37,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:27:37,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:27:37,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:27:37,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:27:37,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:27:37,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:27:37,367 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:27:37,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:27:37,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:27:37,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:27:37,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:27:37,367 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:27:37,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:27:37,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:27:37,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:37,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:27:37,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:27:37,369 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 -> cad39411d7becf64b0716e48fab4680fd039796e30818af24b0de5905de7c645 [2025-03-17 03:27:37,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:27:37,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:27:37,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:27:37,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:27:37,633 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:27:37,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2025-03-17 03:27:38,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1661a4519/47dc67249e1946febf3c352cce77da41/FLAGcf8c822aa [2025-03-17 03:27:38,982 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:27:38,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2025-03-17 03:27:39,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1661a4519/47dc67249e1946febf3c352cce77da41/FLAGcf8c822aa [2025-03-17 03:27:39,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1661a4519/47dc67249e1946febf3c352cce77da41 [2025-03-17 03:27:39,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:27:39,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:27:39,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:39,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:27:39,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:27:39,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6333936c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39, skipping insertion in model container [2025-03-17 03:27:39,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:27:39,446 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-1loop_file-39.i[915,928] [2025-03-17 03:27:39,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:39,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:27:39,497 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-1loop_file-39.i[915,928] [2025-03-17 03:27:39,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:39,519 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:27:39,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39 WrapperNode [2025-03-17 03:27:39,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:39,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:39,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:27:39,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:27:39,524 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:27:39" (1/1) ... [2025-03-17 03:27:39,529 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:27:39" (1/1) ... [2025-03-17 03:27:39,545 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-17 03:27:39,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:39,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:27:39,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:27:39,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:27:39,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,562 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:27:39,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:27:39,571 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:27:39,571 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:27:39,571 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:27:39,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (1/1) ... [2025-03-17 03:27:39,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:39,597 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:27:39,599 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:27:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:27:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:27:39,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:27:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:27:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:27:39,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:27:39,667 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:27:39,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:27:39,853 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:27:39,857 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:27:39,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:27:39,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:27:39,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:39 BoogieIcfgContainer [2025-03-17 03:27:39,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:27:39,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:27:39,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:27:39,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:27:39,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:27:39" (1/3) ... [2025-03-17 03:27:39,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5547fecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:39, skipping insertion in model container [2025-03-17 03:27:39,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:39" (2/3) ... [2025-03-17 03:27:39,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5547fecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:39, skipping insertion in model container [2025-03-17 03:27:39,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:39" (3/3) ... [2025-03-17 03:27:39,871 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-39.i [2025-03-17 03:27:39,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:27:39,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-39.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:27:39,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:27:39,934 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;@7d11d3dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:27:39,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:27:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 03:27:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 03:27:39,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:39,944 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:39,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:39,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1806841756, now seen corresponding path program 1 times [2025-03-17 03:27:39,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235551862] [2025-03-17 03:27:39,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:40,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 03:27:40,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 03:27:40,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:40,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 03:27:40,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235551862] [2025-03-17 03:27:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235551862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:27:40,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891166806] [2025-03-17 03:27:40,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:40,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:27:40,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:40,151 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:27:40,152 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:27:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 03:27:40,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 03:27:40,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:40,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:40,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:27:40,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 03:27:40,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:27:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891166806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:40,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:27:40,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:27:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990521774] [2025-03-17 03:27:40,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:40,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:27:40,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:40,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:27:40,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:27:40,300 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:27:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:40,318 INFO L93 Difference]: Finished difference Result 81 states and 132 transitions. [2025-03-17 03:27:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:27:40,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2025-03-17 03:27:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:40,324 INFO L225 Difference]: With dead ends: 81 [2025-03-17 03:27:40,324 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 03:27:40,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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:27:40,329 INFO L435 NwaCegarLoop]: 58 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, 58 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:27:40,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:27:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 03:27:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 03:27:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 03:27:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2025-03-17 03:27:40,355 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 83 [2025-03-17 03:27:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:40,355 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2025-03-17 03:27:40,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:27:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2025-03-17 03:27:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 03:27:40,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:40,358 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:40,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:27:40,558 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:27:40,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:40,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash 227781281, now seen corresponding path program 1 times [2025-03-17 03:27:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:40,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073472479] [2025-03-17 03:27:40,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:40,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 03:27:40,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 03:27:40,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:40,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:27:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:42,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073472479] [2025-03-17 03:27:42,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073472479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:42,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:42,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:27:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560907069] [2025-03-17 03:27:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:42,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:27:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:42,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:27:42,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:27:42,145 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:27:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:42,518 INFO L93 Difference]: Finished difference Result 144 states and 209 transitions. [2025-03-17 03:27:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:27:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2025-03-17 03:27:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:42,523 INFO L225 Difference]: With dead ends: 144 [2025-03-17 03:27:42,524 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 03:27:42,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:27:42,525 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 81 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:42,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 210 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:27:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 03:27:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2025-03-17 03:27:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:27:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2025-03-17 03:27:42,554 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 83 [2025-03-17 03:27:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:42,554 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2025-03-17 03:27:42,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:27:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2025-03-17 03:27:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 03:27:42,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:42,556 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:42,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:27:42,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:42,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:42,558 INFO L85 PathProgramCache]: Analyzing trace with hash -410643775, now seen corresponding path program 1 times [2025-03-17 03:27:42,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:42,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475489730] [2025-03-17 03:27:42,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:42,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:42,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 03:27:42,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 03:27:42,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:42,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:27:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:42,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475489730] [2025-03-17 03:27:42,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475489730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:42,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:27:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150451306] [2025-03-17 03:27:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:42,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:27:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:42,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:27:42,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:27:42,758 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:27:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:42,850 INFO L93 Difference]: Finished difference Result 192 states and 275 transitions. [2025-03-17 03:27:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:27:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2025-03-17 03:27:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:42,852 INFO L225 Difference]: With dead ends: 192 [2025-03-17 03:27:42,852 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 03:27:42,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:27:42,854 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 40 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:27:42,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 160 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:27:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 03:27:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2025-03-17 03:27:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:27:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2025-03-17 03:27:42,885 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 84 [2025-03-17 03:27:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:42,885 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2025-03-17 03:27:42,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:27:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2025-03-17 03:27:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 03:27:42,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:42,887 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:42,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:27:42,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:42,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash -610703260, now seen corresponding path program 1 times [2025-03-17 03:27:42,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:42,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22708071] [2025-03-17 03:27:42,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:42,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:42,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 03:27:42,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 03:27:42,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:42,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:28:01,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:28:01,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22708071] [2025-03-17 03:28:01,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22708071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:28:01,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:28:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:28:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150623796] [2025-03-17 03:28:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:28:01,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:28:01,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:28:01,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:28:01,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:28:01,336 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:28:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:28:01,621 INFO L93 Difference]: Finished difference Result 131 states and 186 transitions. [2025-03-17 03:28:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:28:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2025-03-17 03:28:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:28:01,622 INFO L225 Difference]: With dead ends: 131 [2025-03-17 03:28:01,624 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 03:28:01,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:28:01,625 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:28:01,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 219 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:28:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 03:28:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2025-03-17 03:28:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:28:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2025-03-17 03:28:01,649 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 84 [2025-03-17 03:28:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:28:01,649 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2025-03-17 03:28:01,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:28:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2025-03-17 03:28:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 03:28:01,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:28:01,651 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:28:01,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:28:01,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:28:01,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:28:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1501539816, now seen corresponding path program 1 times [2025-03-17 03:28:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:28:01,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074608610] [2025-03-17 03:28:01,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:28:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:28:01,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 03:28:01,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 03:28:01,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:28:01,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:28:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:28:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:28:01,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074608610] [2025-03-17 03:28:01,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074608610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:28:01,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:28:01,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:28:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557052431] [2025-03-17 03:28:01,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:28:01,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:28:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:28:01,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:28:01,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:28:01,749 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:28:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:28:01,784 INFO L93 Difference]: Finished difference Result 164 states and 231 transitions. [2025-03-17 03:28:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:28:01,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2025-03-17 03:28:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:28:01,785 INFO L225 Difference]: With dead ends: 164 [2025-03-17 03:28:01,785 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 03:28:01,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:28:01,786 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:28:01,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 98 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:28:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 03:28:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 03:28:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 03:28:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 03:28:01,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2025-03-17 03:28:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:28:01,787 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 03:28:01,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:28:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 03:28:01,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 03:28:01,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:28:01,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:28:01,798 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:28:01,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 03:28:02,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:28:02,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:28:02 BoogieIcfgContainer [2025-03-17 03:28:02,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:28:02,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:28:02,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:28:02,601 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:28:02,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:39" (3/4) ... [2025-03-17 03:28:02,604 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 03:28:02,608 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 03:28:02,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 03:28:02,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 03:28:02,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 03:28:02,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 03:28:02,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 03:28:02,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 03:28:02,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:28:02,685 INFO L158 Benchmark]: Toolchain (without parser) took 23345.00ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 111.1MB in the beginning and 556.3MB in the end (delta: -445.2MB). Peak memory consumption was 461.0MB. Max. memory is 16.1GB. [2025-03-17 03:28:02,685 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:28:02,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.31ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:28:02,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.84ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.3MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:28:02,685 INFO L158 Benchmark]: Boogie Preprocessor took 24.48ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 92.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:28:02,685 INFO L158 Benchmark]: IcfgBuilder took 293.28ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 75.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:28:02,686 INFO L158 Benchmark]: TraceAbstraction took 22734.21ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 75.4MB in the beginning and 564.4MB in the end (delta: -489.1MB). Peak memory consumption was 419.1MB. Max. memory is 16.1GB. [2025-03-17 03:28:02,686 INFO L158 Benchmark]: Witness Printer took 83.78ms. Allocated memory is still 1.0GB. Free memory was 564.4MB in the beginning and 556.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:28:02,687 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.31ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.84ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.3MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.48ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 92.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 293.28ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 75.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22734.21ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 75.4MB in the beginning and 564.4MB in the end (delta: -489.1MB). Peak memory consumption was 419.1MB. Max. memory is 16.1GB. * Witness Printer took 83.78ms. Allocated memory is still 1.0GB. Free memory was 564.4MB in the beginning and 556.3MB in the end (delta: 8.1MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 73 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 745 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 439 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 278 IncrementalHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 306 mSDtfsCounter, 278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=4, InterpolantAutomatonStates: 22, 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, 5 MinimizatonAttempts, 44 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 2177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2865/2889 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 95]: Location Invariant Derived location invariant: (((((((((last_1_var_1_10 == 0) && (var_1_10 == 0)) && (0 <= k_loop)) && (0 <= last_1_var_1_10)) && (10 <= var_1_14)) && (0 <= 0)) && ((((short) var_1_14 + var_1_11) != 0) || (0 < (129 + var_1_11)))) && ((var_1_11 < 128) || (var_1_14 != var_1_11))) || (((((1 <= k_loop) && (10 <= var_1_14)) && (0 <= 0)) && ((((short) var_1_14 + var_1_11) != 0) || (0 < (129 + var_1_11)))) && ((var_1_11 < 128) || (var_1_14 != var_1_11)))) RESULT: Ultimate proved your program to be correct! [2025-03-17 03:28:02,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE