./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label32.c --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/eca-rers2012/Problem03_label32.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 06b61c7a92b1aafb8eaed71c9c03004c8dc3a1341fd95aec7c0057c1c21f0a3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:10:59,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:10:59,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:10:59,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:10:59,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:10:59,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:10:59,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:10:59,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:10:59,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:10:59,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:10:59,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:10:59,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:10:59,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:10:59,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:10:59,907 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:10:59,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:10:59,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:10:59,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:10:59,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:10:59,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:10:59,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:10:59,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:10:59,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:10:59,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:10:59,910 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 -> 06b61c7a92b1aafb8eaed71c9c03004c8dc3a1341fd95aec7c0057c1c21f0a3d [2025-03-16 14:11:00,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:11:00,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:11:00,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:11:00,162 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:11:00,162 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:11:00,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label32.c [2025-03-16 14:11:01,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d481a2f/300de6a5c0974d8eb36a2e25323ab6fd/FLAG99d8f8cf1 [2025-03-16 14:11:01,632 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:11:01,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label32.c [2025-03-16 14:11:01,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d481a2f/300de6a5c0974d8eb36a2e25323ab6fd/FLAG99d8f8cf1 [2025-03-16 14:11:01,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d481a2f/300de6a5c0974d8eb36a2e25323ab6fd [2025-03-16 14:11:01,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:11:01,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:11:01,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:01,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:11:01,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:11:01,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:01" (1/1) ... [2025-03-16 14:11:01,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d186919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:01, skipping insertion in model container [2025-03-16 14:11:01,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:01" (1/1) ... [2025-03-16 14:11:01,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:11:02,089 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/Problem03_label32.c[59744,59757] [2025-03-16 14:11:02,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:02,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:11:02,242 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/Problem03_label32.c[59744,59757] [2025-03-16 14:11:02,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:02,271 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:11:02,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02 WrapperNode [2025-03-16 14:11:02,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:02,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:02,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:11:02,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:11:02,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,385 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:11:02,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:02,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:11:02,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:11:02,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:11:02,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,441 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-16 14:11:02,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:11:02,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:11:02,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:11:02,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:11:02,493 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (1/1) ... [2025-03-16 14:11:02,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:02,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:02,519 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-16 14:11:02,523 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-16 14:11:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:11:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:11:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:11:02,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:11:02,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:11:02,600 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:11:03,978 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:11:03,978 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:11:03,989 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:11:03,989 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:11:03,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:03 BoogieIcfgContainer [2025-03-16 14:11:03,990 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:11:03,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:11:03,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:11:03,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:11:03,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:11:01" (1/3) ... [2025-03-16 14:11:03,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd605d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:03, skipping insertion in model container [2025-03-16 14:11:03,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:02" (2/3) ... [2025-03-16 14:11:03,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd605d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:03, skipping insertion in model container [2025-03-16 14:11:03,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:03" (3/3) ... [2025-03-16 14:11:03,998 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label32.c [2025-03-16 14:11:04,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:11:04,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label32.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:11:04,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:11:04,067 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;@48e7885c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:11:04,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:11:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 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-16 14:11:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 14:11:04,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:04,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:04,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:04,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1921783638, now seen corresponding path program 1 times [2025-03-16 14:11:04,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:04,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276760408] [2025-03-16 14:11:04,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 14:11:04,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:11:04,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:04,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:04,561 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-16 14:11:04,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:04,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276760408] [2025-03-16 14:11:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276760408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:04,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993481306] [2025-03-16 14:11:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:04,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:11:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:04,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:11:04,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:04,589 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 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 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 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-16 14:11:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:04,619 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:11:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:11:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 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 188 [2025-03-16 14:11:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:04,629 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:11:04,629 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:11:04,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 14:11:04,635 INFO L435 NwaCegarLoop]: 395 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, 395 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-16 14:11:04,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:11:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:11:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:11:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 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-16 14:11:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:11:04,669 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 188 [2025-03-16 14:11:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:04,670 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:11:04,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 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-16 14:11:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:11:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 14:11:04,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:04,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:04,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:11:04,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1459967573, now seen corresponding path program 1 times [2025-03-16 14:11:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024369918] [2025-03-16 14:11:04,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:04,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 14:11:04,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:11:04,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:04,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:05,102 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-16 14:11:05,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:05,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024369918] [2025-03-16 14:11:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024369918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:05,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:05,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316381402] [2025-03-16 14:11:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:05,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:05,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:05,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:05,107 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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-16 14:11:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:05,838 INFO L93 Difference]: Finished difference Result 698 states and 1151 transitions. [2025-03-16 14:11:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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 188 [2025-03-16 14:11:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:05,841 INFO L225 Difference]: With dead ends: 698 [2025-03-16 14:11:05,841 INFO L226 Difference]: Without dead ends: 461 [2025-03-16 14:11:05,842 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-16 14:11:05,842 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 67 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:05,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 149 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-16 14:11:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-03-16 14:11:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.539301310043668) internal successors, (705), 458 states have internal predecessors, (705), 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-16 14:11:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2025-03-16 14:11:05,863 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 188 [2025-03-16 14:11:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:05,863 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2025-03-16 14:11:05,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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-16 14:11:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2025-03-16 14:11:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 14:11:05,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:05,865 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:05,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:11:05,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:05,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:05,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1362283943, now seen corresponding path program 1 times [2025-03-16 14:11:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502957150] [2025-03-16 14:11:05,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:05,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:05,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 14:11:05,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 14:11:05,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:05,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:06,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:06,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502957150] [2025-03-16 14:11:06,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502957150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:06,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:06,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:06,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104573392] [2025-03-16 14:11:06,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:06,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:06,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:06,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:06,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:06,019 INFO L87 Difference]: Start difference. First operand 459 states and 705 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 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-16 14:11:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:06,683 INFO L93 Difference]: Finished difference Result 1343 states and 2078 transitions. [2025-03-16 14:11:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:06,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 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 196 [2025-03-16 14:11:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:06,687 INFO L225 Difference]: With dead ends: 1343 [2025-03-16 14:11:06,687 INFO L226 Difference]: Without dead ends: 885 [2025-03-16 14:11:06,688 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-16 14:11:06,689 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:06,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-16 14:11:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 869. [2025-03-16 14:11:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5138248847926268) internal successors, (1314), 868 states have internal predecessors, (1314), 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-16 14:11:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1314 transitions. [2025-03-16 14:11:06,717 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1314 transitions. Word has length 196 [2025-03-16 14:11:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:06,718 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1314 transitions. [2025-03-16 14:11:06,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 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-16 14:11:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1314 transitions. [2025-03-16 14:11:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-16 14:11:06,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:06,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:06,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:11:06,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:06,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:06,725 INFO L85 PathProgramCache]: Analyzing trace with hash -176165476, now seen corresponding path program 1 times [2025-03-16 14:11:06,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:06,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975387904] [2025-03-16 14:11:06,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:06,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-16 14:11:06,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-16 14:11:06,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:06,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:07,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975387904] [2025-03-16 14:11:07,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975387904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:07,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:07,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:07,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324984115] [2025-03-16 14:11:07,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:07,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:11:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:07,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:11:07,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:07,264 INFO L87 Difference]: Start difference. First operand 869 states and 1314 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 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-16 14:11:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:07,998 INFO L93 Difference]: Finished difference Result 1883 states and 2885 transitions. [2025-03-16 14:11:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:11:07,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 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 203 [2025-03-16 14:11:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:08,001 INFO L225 Difference]: With dead ends: 1883 [2025-03-16 14:11:08,003 INFO L226 Difference]: Without dead ends: 841 [2025-03-16 14:11:08,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 14:11:08,005 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 299 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:08,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 45 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-16 14:11:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2025-03-16 14:11:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.3654761904761905) internal successors, (1147), 840 states have internal predecessors, (1147), 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-16 14:11:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1147 transitions. [2025-03-16 14:11:08,040 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1147 transitions. Word has length 203 [2025-03-16 14:11:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:08,041 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1147 transitions. [2025-03-16 14:11:08,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 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-16 14:11:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1147 transitions. [2025-03-16 14:11:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-16 14:11:08,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:08,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:08,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:11:08,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash -704834216, now seen corresponding path program 1 times [2025-03-16 14:11:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535695036] [2025-03-16 14:11:08,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:08,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-16 14:11:08,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 14:11:08,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:08,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535695036] [2025-03-16 14:11:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535695036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:08,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:08,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289002765] [2025-03-16 14:11:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:08,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:08,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:08,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:08,248 INFO L87 Difference]: Start difference. First operand 841 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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-16 14:11:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:08,755 INFO L93 Difference]: Finished difference Result 2503 states and 3419 transitions. [2025-03-16 14:11:08,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:08,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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 211 [2025-03-16 14:11:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:08,760 INFO L225 Difference]: With dead ends: 2503 [2025-03-16 14:11:08,760 INFO L226 Difference]: Without dead ends: 1663 [2025-03-16 14:11:08,761 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-16 14:11:08,762 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 227 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:08,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 70 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-03-16 14:11:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1662. [2025-03-16 14:11:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 1.3245033112582782) internal successors, (2200), 1661 states have internal predecessors, (2200), 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-16 14:11:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2200 transitions. [2025-03-16 14:11:08,786 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2200 transitions. Word has length 211 [2025-03-16 14:11:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:08,786 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2200 transitions. [2025-03-16 14:11:08,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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-16 14:11:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2200 transitions. [2025-03-16 14:11:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-16 14:11:08,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:08,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:08,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:11:08,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:08,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2058189804, now seen corresponding path program 1 times [2025-03-16 14:11:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:08,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367746147] [2025-03-16 14:11:08,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:08,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:08,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-16 14:11:08,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-16 14:11:08,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:08,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:09,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:09,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367746147] [2025-03-16 14:11:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367746147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:09,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334572132] [2025-03-16 14:11:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:09,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:11:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:09,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:11:09,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:09,224 INFO L87 Difference]: Start difference. First operand 1662 states and 2200 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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-16 14:11:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:10,099 INFO L93 Difference]: Finished difference Result 4322 states and 5737 transitions. [2025-03-16 14:11:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:11:10,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 219 [2025-03-16 14:11:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:10,107 INFO L225 Difference]: With dead ends: 4322 [2025-03-16 14:11:10,108 INFO L226 Difference]: Without dead ends: 2487 [2025-03-16 14:11:10,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 14:11:10,110 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 193 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:10,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 98 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:11:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2025-03-16 14:11:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2486. [2025-03-16 14:11:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2485 states have (on average 1.3074446680080483) internal successors, (3249), 2485 states have internal predecessors, (3249), 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-16 14:11:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3249 transitions. [2025-03-16 14:11:10,159 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3249 transitions. Word has length 219 [2025-03-16 14:11:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:10,159 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3249 transitions. [2025-03-16 14:11:10,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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-16 14:11:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3249 transitions. [2025-03-16 14:11:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-16 14:11:10,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:10,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:10,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:11:10,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:10,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:10,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1478198586, now seen corresponding path program 1 times [2025-03-16 14:11:10,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:10,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897443821] [2025-03-16 14:11:10,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:10,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:10,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-16 14:11:10,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-16 14:11:10,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:10,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:11:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897443821] [2025-03-16 14:11:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897443821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:10,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:10,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371278622] [2025-03-16 14:11:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:10,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:10,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:10,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:10,327 INFO L87 Difference]: Start difference. First operand 2486 states and 3249 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 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-16 14:11:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:10,901 INFO L93 Difference]: Finished difference Result 6627 states and 8635 transitions. [2025-03-16 14:11:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 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 221 [2025-03-16 14:11:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:10,913 INFO L225 Difference]: With dead ends: 6627 [2025-03-16 14:11:10,913 INFO L226 Difference]: Without dead ends: 4142 [2025-03-16 14:11:10,915 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-16 14:11:10,916 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 202 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:10,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 116 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2025-03-16 14:11:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 4139. [2025-03-16 14:11:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4139 states, 4138 states have (on average 1.2962783953600774) internal successors, (5364), 4138 states have internal predecessors, (5364), 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-16 14:11:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 5364 transitions. [2025-03-16 14:11:10,982 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 5364 transitions. Word has length 221 [2025-03-16 14:11:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:10,982 INFO L471 AbstractCegarLoop]: Abstraction has 4139 states and 5364 transitions. [2025-03-16 14:11:10,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 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-16 14:11:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 5364 transitions. [2025-03-16 14:11:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 14:11:10,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:10,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:10,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:11:10,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:10,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:10,990 INFO L85 PathProgramCache]: Analyzing trace with hash -478100151, now seen corresponding path program 1 times [2025-03-16 14:11:10,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:10,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517706885] [2025-03-16 14:11:10,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:10,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:11,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:11:11,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:11:11,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:11,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517706885] [2025-03-16 14:11:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517706885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138967241] [2025-03-16 14:11:11,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:11,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:11,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:11,787 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-16 14:11:11,789 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-16 14:11:11,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:11:11,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:11:11,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:11,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:11,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:11,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 14:11:12,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138967241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:12,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:12,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958535210] [2025-03-16 14:11:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:12,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:12,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:12,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:12,159 INFO L87 Difference]: Start difference. First operand 4139 states and 5364 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-16 14:11:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:12,783 INFO L93 Difference]: Finished difference Result 8286 states and 10743 transitions. [2025-03-16 14:11:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:12,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 226 [2025-03-16 14:11:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:12,797 INFO L225 Difference]: With dead ends: 8286 [2025-03-16 14:11:12,798 INFO L226 Difference]: Without dead ends: 4148 [2025-03-16 14:11:12,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:12,802 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:12,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 318 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2025-03-16 14:11:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 4139. [2025-03-16 14:11:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4139 states, 4138 states have (on average 1.2858869018849686) internal successors, (5321), 4138 states have internal predecessors, (5321), 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-16 14:11:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 5321 transitions. [2025-03-16 14:11:12,873 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 5321 transitions. Word has length 226 [2025-03-16 14:11:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:12,873 INFO L471 AbstractCegarLoop]: Abstraction has 4139 states and 5321 transitions. [2025-03-16 14:11:12,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-16 14:11:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 5321 transitions. [2025-03-16 14:11:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 14:11:12,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:12,881 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:12,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:13,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 422452754, now seen corresponding path program 1 times [2025-03-16 14:11:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805285512] [2025-03-16 14:11:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:13,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 14:11:13,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 14:11:13,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:13,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:13,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805285512] [2025-03-16 14:11:13,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805285512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719266460] [2025-03-16 14:11:13,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:13,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:13,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:13,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:11:13,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 14:11:13,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 14:11:13,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:13,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:13,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:13,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:11:14,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719266460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329802236] [2025-03-16 14:11:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:14,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:14,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:14,129 INFO L87 Difference]: Start difference. First operand 4139 states and 5321 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-16 14:11:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:14,654 INFO L93 Difference]: Finished difference Result 12343 states and 15867 transitions. [2025-03-16 14:11:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:14,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 232 [2025-03-16 14:11:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:14,677 INFO L225 Difference]: With dead ends: 12343 [2025-03-16 14:11:14,677 INFO L226 Difference]: Without dead ends: 8205 [2025-03-16 14:11:14,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:14,686 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:14,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 341 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2025-03-16 14:11:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 8199. [2025-03-16 14:11:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8199 states, 8198 states have (on average 1.176384484020493) internal successors, (9644), 8198 states have internal predecessors, (9644), 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-16 14:11:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8199 states to 8199 states and 9644 transitions. [2025-03-16 14:11:14,809 INFO L78 Accepts]: Start accepts. Automaton has 8199 states and 9644 transitions. Word has length 232 [2025-03-16 14:11:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:14,811 INFO L471 AbstractCegarLoop]: Abstraction has 8199 states and 9644 transitions. [2025-03-16 14:11:14,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-16 14:11:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 9644 transitions. [2025-03-16 14:11:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 14:11:14,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:14,821 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:14,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:15,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-16 14:11:15,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:15,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1402823602, now seen corresponding path program 1 times [2025-03-16 14:11:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010953603] [2025-03-16 14:11:15,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:15,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 14:11:15,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 14:11:15,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:15,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010953603] [2025-03-16 14:11:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010953603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:15,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150504437] [2025-03-16 14:11:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:15,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:15,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:15,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:15,164 INFO L87 Difference]: Start difference. First operand 8199 states and 9644 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-16 14:11:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:15,723 INFO L93 Difference]: Finished difference Result 24138 states and 28366 transitions. [2025-03-16 14:11:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 242 [2025-03-16 14:11:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:15,756 INFO L225 Difference]: With dead ends: 24138 [2025-03-16 14:11:15,757 INFO L226 Difference]: Without dead ends: 15940 [2025-03-16 14:11:15,769 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-16 14:11:15,769 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 227 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:15,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 326 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2025-03-16 14:11:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15931. [2025-03-16 14:11:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15931 states, 15930 states have (on average 1.151412429378531) internal successors, (18342), 15930 states have internal predecessors, (18342), 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-16 14:11:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15931 states to 15931 states and 18342 transitions. [2025-03-16 14:11:15,988 INFO L78 Accepts]: Start accepts. Automaton has 15931 states and 18342 transitions. Word has length 242 [2025-03-16 14:11:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:15,988 INFO L471 AbstractCegarLoop]: Abstraction has 15931 states and 18342 transitions. [2025-03-16 14:11:15,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-16 14:11:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 15931 states and 18342 transitions. [2025-03-16 14:11:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 14:11:16,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:16,007 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:16,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:11:16,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1329685123, now seen corresponding path program 1 times [2025-03-16 14:11:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507441284] [2025-03-16 14:11:16,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:16,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 14:11:16,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 14:11:16,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:16,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 14:11:16,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:16,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507441284] [2025-03-16 14:11:16,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507441284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:16,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518838536] [2025-03-16 14:11:16,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:16,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:16,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:16,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:16,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:11:16,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 14:11:16,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 14:11:16,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:16,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:16,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:16,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:11:16,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518838536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:16,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:16,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:11:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135009748] [2025-03-16 14:11:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:16,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:16,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:16,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:16,472 INFO L87 Difference]: Start difference. First operand 15931 states and 18342 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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-16 14:11:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:17,050 INFO L93 Difference]: Finished difference Result 37754 states and 44086 transitions. [2025-03-16 14:11:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:17,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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 261 [2025-03-16 14:11:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:17,082 INFO L225 Difference]: With dead ends: 37754 [2025-03-16 14:11:17,083 INFO L226 Difference]: Without dead ends: 21824 [2025-03-16 14:11:17,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:17,095 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 203 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:17,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 113 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21824 states. [2025-03-16 14:11:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21824 to 21818. [2025-03-16 14:11:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21818 states, 21817 states have (on average 1.1306320759041115) internal successors, (24667), 21817 states have internal predecessors, (24667), 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-16 14:11:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21818 states to 21818 states and 24667 transitions. [2025-03-16 14:11:17,327 INFO L78 Accepts]: Start accepts. Automaton has 21818 states and 24667 transitions. Word has length 261 [2025-03-16 14:11:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:17,327 INFO L471 AbstractCegarLoop]: Abstraction has 21818 states and 24667 transitions. [2025-03-16 14:11:17,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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-16 14:11:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 21818 states and 24667 transitions. [2025-03-16 14:11:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 14:11:17,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:17,349 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:17,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:11:17,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:17,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:17,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash -342420408, now seen corresponding path program 1 times [2025-03-16 14:11:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:17,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682830560] [2025-03-16 14:11:17,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:17,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:17,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 14:11:17,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 14:11:17,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:17,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682830560] [2025-03-16 14:11:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682830560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:17,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:17,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223217227] [2025-03-16 14:11:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:17,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:17,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:17,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:17,742 INFO L87 Difference]: Start difference. First operand 21818 states and 24667 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 2 states have internal predecessors, (263), 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-16 14:11:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:18,374 INFO L93 Difference]: Finished difference Result 59133 states and 66907 transitions. [2025-03-16 14:11:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:18,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 2 states have internal predecessors, (263), 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 263 [2025-03-16 14:11:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:18,422 INFO L225 Difference]: With dead ends: 59133 [2025-03-16 14:11:18,422 INFO L226 Difference]: Without dead ends: 37316 [2025-03-16 14:11:18,446 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-16 14:11:18,447 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 155 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:18,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 141 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37316 states. [2025-03-16 14:11:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37316 to 37313. [2025-03-16 14:11:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37313 states, 37312 states have (on average 1.1303870068610635) internal successors, (42177), 37312 states have internal predecessors, (42177), 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-16 14:11:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37313 states to 37313 states and 42177 transitions. [2025-03-16 14:11:18,778 INFO L78 Accepts]: Start accepts. Automaton has 37313 states and 42177 transitions. Word has length 263 [2025-03-16 14:11:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:18,779 INFO L471 AbstractCegarLoop]: Abstraction has 37313 states and 42177 transitions. [2025-03-16 14:11:18,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 2 states have internal predecessors, (263), 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-16 14:11:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 37313 states and 42177 transitions. [2025-03-16 14:11:18,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 14:11:18,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:18,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:11:18,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash 546836646, now seen corresponding path program 1 times [2025-03-16 14:11:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802877040] [2025-03-16 14:11:18,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:18,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:11:18,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:11:18,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:18,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802877040] [2025-03-16 14:11:19,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802877040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703628633] [2025-03-16 14:11:19,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:19,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:19,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:19,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:11:19,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:11:19,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:11:19,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:19,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:19,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:19,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:19,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703628633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:19,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:19,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:19,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666901457] [2025-03-16 14:11:19,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:19,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:19,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:19,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:19,812 INFO L87 Difference]: Start difference. First operand 37313 states and 42177 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-16 14:11:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:20,384 INFO L93 Difference]: Finished difference Result 73415 states and 82905 transitions. [2025-03-16 14:11:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 268 [2025-03-16 14:11:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:20,424 INFO L225 Difference]: With dead ends: 73415 [2025-03-16 14:11:20,424 INFO L226 Difference]: Without dead ends: 36103 [2025-03-16 14:11:20,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:20,445 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:20,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 75 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36103 states. [2025-03-16 14:11:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36103 to 36086. [2025-03-16 14:11:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36086 states, 36085 states have (on average 1.110877095746155) internal successors, (40086), 36085 states have internal predecessors, (40086), 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-16 14:11:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36086 states to 36086 states and 40086 transitions. [2025-03-16 14:11:20,779 INFO L78 Accepts]: Start accepts. Automaton has 36086 states and 40086 transitions. Word has length 268 [2025-03-16 14:11:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:20,779 INFO L471 AbstractCegarLoop]: Abstraction has 36086 states and 40086 transitions. [2025-03-16 14:11:20,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-16 14:11:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 36086 states and 40086 transitions. [2025-03-16 14:11:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-16 14:11:20,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:20,798 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:20,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:20,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:20,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1283010343, now seen corresponding path program 1 times [2025-03-16 14:11:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595785847] [2025-03-16 14:11:20,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:21,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-16 14:11:21,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-16 14:11:21,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:21,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595785847] [2025-03-16 14:11:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595785847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576709523] [2025-03-16 14:11:22,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:22,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:22,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:22,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:11:22,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-16 14:11:22,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-16 14:11:22,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:22,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:22,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:22,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:22,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576709523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:22,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 14:11:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144576986] [2025-03-16 14:11:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:22,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:22,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:22,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:22,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:22,430 INFO L87 Difference]: Start difference. First operand 36086 states and 40086 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-16 14:11:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:22,953 INFO L93 Difference]: Finished difference Result 72183 states and 80191 transitions. [2025-03-16 14:11:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:22,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 284 [2025-03-16 14:11:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:22,991 INFO L225 Difference]: With dead ends: 72183 [2025-03-16 14:11:22,991 INFO L226 Difference]: Without dead ends: 36098 [2025-03-16 14:11:23,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:23,018 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 75 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:23,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 275 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36098 states. [2025-03-16 14:11:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36098 to 36086. [2025-03-16 14:11:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36086 states, 36085 states have (on average 1.1042538450879866) internal successors, (39847), 36085 states have internal predecessors, (39847), 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-16 14:11:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36086 states to 36086 states and 39847 transitions. [2025-03-16 14:11:23,368 INFO L78 Accepts]: Start accepts. Automaton has 36086 states and 39847 transitions. Word has length 284 [2025-03-16 14:11:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:23,368 INFO L471 AbstractCegarLoop]: Abstraction has 36086 states and 39847 transitions. [2025-03-16 14:11:23,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-16 14:11:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 36086 states and 39847 transitions. [2025-03-16 14:11:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-16 14:11:23,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:23,398 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:23,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:11:23,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:11:23,599 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:23,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash -156457590, now seen corresponding path program 1 times [2025-03-16 14:11:23,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:23,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730695589] [2025-03-16 14:11:23,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:23,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:23,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-16 14:11:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-16 14:11:23,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:23,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730695589] [2025-03-16 14:11:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730695589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110139953] [2025-03-16 14:11:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:23,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:23,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:23,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:23,831 INFO L87 Difference]: Start difference. First operand 36086 states and 39847 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-16 14:11:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:24,382 INFO L93 Difference]: Finished difference Result 71931 states and 79381 transitions. [2025-03-16 14:11:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:24,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 393 [2025-03-16 14:11:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:24,425 INFO L225 Difference]: With dead ends: 71931 [2025-03-16 14:11:24,426 INFO L226 Difference]: Without dead ends: 35846 [2025-03-16 14:11:24,450 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-16 14:11:24,451 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 134 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:24,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 313 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35846 states. [2025-03-16 14:11:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35846 to 35839. [2025-03-16 14:11:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35839 states, 35838 states have (on average 1.0839332552039735) internal successors, (38846), 35838 states have internal predecessors, (38846), 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-16 14:11:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35839 states to 35839 states and 38846 transitions. [2025-03-16 14:11:24,773 INFO L78 Accepts]: Start accepts. Automaton has 35839 states and 38846 transitions. Word has length 393 [2025-03-16 14:11:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:24,774 INFO L471 AbstractCegarLoop]: Abstraction has 35839 states and 38846 transitions. [2025-03-16 14:11:24,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-16 14:11:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 35839 states and 38846 transitions. [2025-03-16 14:11:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-16 14:11:24,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:24,800 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-03-16 14:11:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:11:24,800 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:24,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1924235627, now seen corresponding path program 1 times [2025-03-16 14:11:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318960789] [2025-03-16 14:11:24,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:24,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-16 14:11:24,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-16 14:11:24,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:24,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-16 14:11:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318960789] [2025-03-16 14:11:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318960789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957912413] [2025-03-16 14:11:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:25,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:25,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:25,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:25,017 INFO L87 Difference]: Start difference. First operand 35839 states and 38846 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-16 14:11:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:25,542 INFO L93 Difference]: Finished difference Result 71068 states and 76995 transitions. [2025-03-16 14:11:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:25,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 420 [2025-03-16 14:11:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:25,581 INFO L225 Difference]: With dead ends: 71068 [2025-03-16 14:11:25,581 INFO L226 Difference]: Without dead ends: 35230 [2025-03-16 14:11:25,605 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-16 14:11:25,606 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 214 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:25,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 300 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35230 states. [2025-03-16 14:11:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35230 to 32582. [2025-03-16 14:11:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32582 states, 32581 states have (on average 1.0688131119364046) internal successors, (34823), 32581 states have internal predecessors, (34823), 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-16 14:11:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32582 states to 32582 states and 34823 transitions. [2025-03-16 14:11:25,895 INFO L78 Accepts]: Start accepts. Automaton has 32582 states and 34823 transitions. Word has length 420 [2025-03-16 14:11:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:25,896 INFO L471 AbstractCegarLoop]: Abstraction has 32582 states and 34823 transitions. [2025-03-16 14:11:25,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-16 14:11:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 32582 states and 34823 transitions. [2025-03-16 14:11:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-16 14:11:25,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:25,917 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:11:25,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:11:25,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:25,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1978125944, now seen corresponding path program 1 times [2025-03-16 14:11:25,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:25,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097375754] [2025-03-16 14:11:25,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:25,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:25,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-16 14:11:25,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-16 14:11:25,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:25,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 223 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-16 14:11:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097375754] [2025-03-16 14:11:27,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097375754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:27,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831789940] [2025-03-16 14:11:27,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:27,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:27,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:27,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:11:27,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-16 14:11:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-16 14:11:27,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:27,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:11:27,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-16 14:11:27,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831789940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599502341] [2025-03-16 14:11:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:27,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:27,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:27,575 INFO L87 Difference]: Start difference. First operand 32582 states and 34823 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-16 14:11:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:28,220 INFO L93 Difference]: Finished difference Result 78591 states and 84015 transitions. [2025-03-16 14:11:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:28,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 440 [2025-03-16 14:11:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:28,222 INFO L225 Difference]: With dead ends: 78591 [2025-03-16 14:11:28,222 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:11:28,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:28,254 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 40 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:28,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 315 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:11:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:11:28,255 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-16 14:11:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:11:28,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 440 [2025-03-16 14:11:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:28,256 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:11:28,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-16 14:11:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:11:28,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:11:28,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:11:28,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:28,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 14:11:28,463 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:28,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:11:30,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:11:30,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:11:30 BoogieIcfgContainer [2025-03-16 14:11:30,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:11:30,414 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:11:30,414 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:11:30,414 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:11:30,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:03" (3/4) ... [2025-03-16 14:11:30,419 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:11:30,449 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:11:30,450 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:11:30,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:11:30,453 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:11:30,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:11:30,589 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:11:30,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:11:30,590 INFO L158 Benchmark]: Toolchain (without parser) took 28925.85ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 98.9MB in the beginning and 836.2MB in the end (delta: -737.2MB). Peak memory consumption was 817.5MB. Max. memory is 16.1GB. [2025-03-16 14:11:30,590 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 127.7MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:11:30,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.84ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 39.9MB in the end (delta: 58.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 14:11:30,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.65ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 90.4MB in the end (delta: -50.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2025-03-16 14:11:30,591 INFO L158 Benchmark]: Boogie Preprocessor took 105.03ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 79.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:11:30,591 INFO L158 Benchmark]: IcfgBuilder took 1498.16ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 79.3MB in the beginning and 188.0MB in the end (delta: -108.7MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2025-03-16 14:11:30,591 INFO L158 Benchmark]: TraceAbstraction took 26421.57ms. Allocated memory was 302.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 187.0MB in the beginning and 861.3MB in the end (delta: -674.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-16 14:11:30,592 INFO L158 Benchmark]: Witness Printer took 175.21ms. Allocated memory is still 1.7GB. Free memory was 861.3MB in the beginning and 836.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:11:30,593 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.55ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 127.7MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.84ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 39.9MB in the end (delta: 58.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.65ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 90.4MB in the end (delta: -50.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.03ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 79.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1498.16ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 79.3MB in the beginning and 188.0MB in the end (delta: -108.7MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26421.57ms. Allocated memory was 302.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 187.0MB in the beginning and 861.3MB in the end (delta: -674.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 175.21ms. Allocated memory is still 1.7GB. Free memory was 861.3MB in the beginning and 836.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 1612]: 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, 241 locations, 457 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2417 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2417 mSDsluCounter, 3480 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 1470 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9435 IncrementalHoareTripleChecker+Invalid, 10905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1470 mSolverCounterUnsat, 3202 mSDtfsCounter, 9435 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1756 GetRequests, 1721 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37313occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 2740 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 6166 NumberOfCodeBlocks, 6166 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6143 ConstructedInterpolants, 0 QuantifiedInterpolants, 28118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3076 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 2572/2667 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: 1668]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0)) || (((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a11 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 1)) && (a11 == 1)) && (a6 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a3 <= 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a3 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:11:30,610 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