./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label41.c -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 40a5d6cfc2906fb78e842e2acc20834b9d9ef51616470f27f80518312cafa40b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:58:53,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:58:53,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:58:53,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:58:53,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:58:53,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:58:53,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:58:53,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:58:53,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:58:53,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:58:53,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:58:53,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:58:53,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:58:53,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:58:53,643 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:58:53,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:58:53,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:58:53,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:58:53,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:58:53,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:58:53,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:58:53,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:58:53,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:58:53,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:58:53,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:58:53,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:58:53,645 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 -> 40a5d6cfc2906fb78e842e2acc20834b9d9ef51616470f27f80518312cafa40b [2025-03-08 00:58:53,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:58:53,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:58:53,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:58:53,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:58:53,910 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:58:53,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label41.c [2025-03-08 00:58:55,029 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c841721/fcf59660373944f7b66c3dae1ccd2220/FLAGd4bc56541 [2025-03-08 00:58:55,312 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:58:55,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label41.c [2025-03-08 00:58:55,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c841721/fcf59660373944f7b66c3dae1ccd2220/FLAGd4bc56541 [2025-03-08 00:58:55,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c841721/fcf59660373944f7b66c3dae1ccd2220 [2025-03-08 00:58:55,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:58:55,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:58:55,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:58:55,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:58:55,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:58:55,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:55,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f53cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55, skipping insertion in model container [2025-03-08 00:58:55,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:55,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:58:55,823 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/eca-rers2012/Problem02_label41.c[15650,15663] [2025-03-08 00:58:55,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:58:55,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:58:55,921 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/eca-rers2012/Problem02_label41.c[15650,15663] [2025-03-08 00:58:55,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:58:55,946 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:58:55,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55 WrapperNode [2025-03-08 00:58:55,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:58:55,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:58:55,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:58:55,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:58:55,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:55,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:55,997 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-08 00:58:55,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:58:55,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:58:55,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:58:55,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:58:56,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,034 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 00:58:56,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:58:56,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:58:56,078 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:58:56,078 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:58:56,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (1/1) ... [2025-03-08 00:58:56,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:58:56,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:58:56,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:58:56,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:58:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:58:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:58:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:58:56,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:58:56,188 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:58:56,190 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:58:56,968 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 00:58:56,968 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:58:56,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:58:56,978 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:58:56,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:56 BoogieIcfgContainer [2025-03-08 00:58:56,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:58:56,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:58:56,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:58:56,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:58:56,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:58:55" (1/3) ... [2025-03-08 00:58:56,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da914b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:58:56, skipping insertion in model container [2025-03-08 00:58:56,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:58:55" (2/3) ... [2025-03-08 00:58:56,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da914b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:58:56, skipping insertion in model container [2025-03-08 00:58:56,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:56" (3/3) ... [2025-03-08 00:58:56,986 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label41.c [2025-03-08 00:58:56,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:58:57,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label41.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:58:57,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:58:57,055 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;@3a8f32e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:58:57,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:58:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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-08 00:58:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 00:58:57,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:57,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:57,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:57,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash -867967619, now seen corresponding path program 1 times [2025-03-08 00:58:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:57,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486465347] [2025-03-08 00:58:57,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:57,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 00:58:57,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 00:58:57,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:57,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:57,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486465347] [2025-03-08 00:58:57,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486465347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:57,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:57,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:58:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558181294] [2025-03-08 00:58:57,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:57,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:57,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:57,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:57,575 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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) Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-08 00:58:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:58,165 INFO L93 Difference]: Finished difference Result 600 states and 1034 transitions. [2025-03-08 00:58:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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) Word has length 90 [2025-03-08 00:58:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:58,174 INFO L225 Difference]: With dead ends: 600 [2025-03-08 00:58:58,174 INFO L226 Difference]: Without dead ends: 309 [2025-03-08 00:58:58,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:58,178 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 76 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:58,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:58:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-08 00:58:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2025-03-08 00:58:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 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-08 00:58:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2025-03-08 00:58:58,212 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 90 [2025-03-08 00:58:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:58,212 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2025-03-08 00:58:58,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-08 00:58:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2025-03-08 00:58:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 00:58:58,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:58,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:58,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:58:58,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:58,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:58,215 INFO L85 PathProgramCache]: Analyzing trace with hash 413159482, now seen corresponding path program 1 times [2025-03-08 00:58:58,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:58,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828319150] [2025-03-08 00:58:58,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:58,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 00:58:58,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 00:58:58,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:58,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828319150] [2025-03-08 00:58:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828319150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:58,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:58,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:58:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763111649] [2025-03-08 00:58:58,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:58,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:58,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:58,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:58,430 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-08 00:58:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:58,862 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2025-03-08 00:58:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) Word has length 95 [2025-03-08 00:58:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:58,866 INFO L225 Difference]: With dead ends: 758 [2025-03-08 00:58:58,866 INFO L226 Difference]: Without dead ends: 453 [2025-03-08 00:58:58,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:58,868 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 74 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:58,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 250 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:58:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-08 00:58:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-03-08 00:58:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 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-08 00:58:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2025-03-08 00:58:58,882 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 95 [2025-03-08 00:58:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:58,883 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2025-03-08 00:58:58,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-08 00:58:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2025-03-08 00:58:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 00:58:58,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:58,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:58,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:58:58,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:58,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:58,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1830216247, now seen corresponding path program 1 times [2025-03-08 00:58:58,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:58,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43268246] [2025-03-08 00:58:58,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:58,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:58,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 00:58:58,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 00:58:58,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:58,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:58,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:58,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43268246] [2025-03-08 00:58:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43268246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:58,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:58,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:58:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284924751] [2025-03-08 00:58:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:58,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:58,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:58,960 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-08 00:58:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:59,329 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2025-03-08 00:58:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:59,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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) Word has length 107 [2025-03-08 00:58:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:59,332 INFO L225 Difference]: With dead ends: 1325 [2025-03-08 00:58:59,332 INFO L226 Difference]: Without dead ends: 874 [2025-03-08 00:58:59,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:59,334 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:59,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:58:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-08 00:58:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-08 00:58:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 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-08 00:58:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2025-03-08 00:58:59,355 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 107 [2025-03-08 00:58:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:59,356 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2025-03-08 00:58:59,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-08 00:58:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2025-03-08 00:58:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 00:58:59,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:59,362 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:59,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:58:59,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:59,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash -862798502, now seen corresponding path program 1 times [2025-03-08 00:58:59,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:59,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185955719] [2025-03-08 00:58:59,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:59,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:59,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:58:59,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:58:59,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:59,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:58:59,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185955719] [2025-03-08 00:58:59,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185955719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:59,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:58:59,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:58:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045328846] [2025-03-08 00:58:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:59,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:59,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:59,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:59,518 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-08 00:58:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:59,886 INFO L93 Difference]: Finished difference Result 2027 states and 2555 transitions. [2025-03-08 00:58:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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) Word has length 120 [2025-03-08 00:58:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:59,890 INFO L225 Difference]: With dead ends: 2027 [2025-03-08 00:58:59,890 INFO L226 Difference]: Without dead ends: 1155 [2025-03-08 00:58:59,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:58:59,892 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 84 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:59,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 228 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:58:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-03-08 00:58:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1154. [2025-03-08 00:58:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.2437120555073722) internal successors, (1434), 1153 states have internal predecessors, (1434), 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-08 00:58:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1434 transitions. [2025-03-08 00:58:59,912 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1434 transitions. Word has length 120 [2025-03-08 00:58:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:59,912 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1434 transitions. [2025-03-08 00:58:59,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-08 00:58:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1434 transitions. [2025-03-08 00:58:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 00:58:59,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:59,914 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:59,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:58:59,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:59,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:59,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1861097137, now seen corresponding path program 1 times [2025-03-08 00:58:59,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:59,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868522048] [2025-03-08 00:58:59,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:59,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:59,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 00:58:59,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 00:58:59,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:59,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:00,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:00,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868522048] [2025-03-08 00:59:00,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868522048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:00,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:00,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689326134] [2025-03-08 00:59:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:00,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:00,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:00,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:00,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:00,015 INFO L87 Difference]: Start difference. First operand 1154 states and 1434 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-08 00:59:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:00,222 INFO L93 Difference]: Finished difference Result 2295 states and 2852 transitions. [2025-03-08 00:59:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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) Word has length 123 [2025-03-08 00:59:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:00,226 INFO L225 Difference]: With dead ends: 2295 [2025-03-08 00:59:00,227 INFO L226 Difference]: Without dead ends: 1143 [2025-03-08 00:59:00,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:00,229 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:00,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 23 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:59:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-08 00:59:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2025-03-08 00:59:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.1996497373029773) internal successors, (1370), 1142 states have internal predecessors, (1370), 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-08 00:59:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1370 transitions. [2025-03-08 00:59:00,252 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1370 transitions. Word has length 123 [2025-03-08 00:59:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:00,253 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1370 transitions. [2025-03-08 00:59:00,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-08 00:59:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1370 transitions. [2025-03-08 00:59:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 00:59:00,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:00,256 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:59:00,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1501853054, now seen corresponding path program 1 times [2025-03-08 00:59:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626411597] [2025-03-08 00:59:00,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:00,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 00:59:00,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 00:59:00,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:00,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:59:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626411597] [2025-03-08 00:59:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626411597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:00,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570636580] [2025-03-08 00:59:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:00,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:00,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:00,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:00,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:00,342 INFO L87 Difference]: Start difference. First operand 1143 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-08 00:59:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:00,654 INFO L93 Difference]: Finished difference Result 3128 states and 3710 transitions. [2025-03-08 00:59:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) Word has length 129 [2025-03-08 00:59:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:00,660 INFO L225 Difference]: With dead ends: 3128 [2025-03-08 00:59:00,660 INFO L226 Difference]: Without dead ends: 1987 [2025-03-08 00:59:00,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:00,663 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:00,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 88 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-08 00:59:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1704. [2025-03-08 00:59:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 1.171462125660599) internal successors, (1995), 1703 states have internal predecessors, (1995), 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-08 00:59:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1995 transitions. [2025-03-08 00:59:00,693 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1995 transitions. Word has length 129 [2025-03-08 00:59:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:00,693 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 1995 transitions. [2025-03-08 00:59:00,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-08 00:59:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1995 transitions. [2025-03-08 00:59:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 00:59:00,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:00,696 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:00,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:59:00,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:00,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash 658479127, now seen corresponding path program 1 times [2025-03-08 00:59:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481464792] [2025-03-08 00:59:00,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:00,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 00:59:00,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 00:59:00,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:00,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:00,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:00,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481464792] [2025-03-08 00:59:00,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481464792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:00,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:00,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576687067] [2025-03-08 00:59:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:00,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:00,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:00,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:00,798 INFO L87 Difference]: Start difference. First operand 1704 states and 1995 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-08 00:59:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:01,107 INFO L93 Difference]: Finished difference Result 4242 states and 4910 transitions. [2025-03-08 00:59:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:01,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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) Word has length 143 [2025-03-08 00:59:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:01,108 INFO L225 Difference]: With dead ends: 4242 [2025-03-08 00:59:01,109 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:59:01,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:01,112 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 100 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:01,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 41 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:59:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:59:01,114 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-08 00:59:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:59:01,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2025-03-08 00:59:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:01,114 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:59:01,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-08 00:59:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:59:01,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:59:01,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:59:01,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:59:01,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:01,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:59:01,235 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:59:01,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:59:01 BoogieIcfgContainer [2025-03-08 00:59:01,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:59:01,250 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:59:01,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:59:01,250 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:59:01,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:58:56" (3/4) ... [2025-03-08 00:59:01,252 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:59:01,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 00:59:01,266 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:59:01,266 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:59:01,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:59:01,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:59:01,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:59:01,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:59:01,352 INFO L158 Benchmark]: Toolchain (without parser) took 5733.32ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 45.3MB in the end (delta: 87.1MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2025-03-08 00:59:01,352 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:59:01,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.03ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 106.1MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:59:01,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.95ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 100.9MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:59:01,353 INFO L158 Benchmark]: Boogie Preprocessor took 77.89ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 97.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:59:01,353 INFO L158 Benchmark]: IcfgBuilder took 901.53ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 102.0MB in the end (delta: -4.7MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-03-08 00:59:01,353 INFO L158 Benchmark]: TraceAbstraction took 4269.06ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 56.6MB in the end (delta: 44.5MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-03-08 00:59:01,354 INFO L158 Benchmark]: Witness Printer took 102.09ms. Allocated memory is still 167.8MB. Free memory was 56.6MB in the beginning and 45.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:59:01,354 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.49ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.03ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 106.1MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.95ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 100.9MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.89ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 97.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 901.53ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 102.0MB in the end (delta: -4.7MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4269.06ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 56.6MB in the end (delta: 44.5MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Witness Printer took 102.09ms. Allocated memory is still 167.8MB. Free memory was 56.6MB in the beginning and 45.3MB in the end (delta: 11.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 - PositiveResult [Line: 452]: 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 1 procedures, 227 locations, 374 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 881 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2378 IncrementalHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 530 mSolverCounterUnsat, 785 mSDtfsCounter, 2378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1704occurred in iteration=6, InterpolantAutomatonStates: 21, 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, 7 MinimizatonAttempts, 286 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 800 ConstructedInterpolants, 0 QuantifiedInterpolants, 1742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 189/189 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: 616]: Location Invariant Derived location invariant: ((((((a17 <= 8) && (a25 != 1)) && (a11 != 1)) || ((a17 <= 8) && (a28 <= 7))) || (((a17 <= 8) && (a19 == 1)) && (a11 != 1))) || ((9 <= a28) && (a17 <= 8))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:59:01,367 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