./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label33.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/Problem02_label33.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 0dc7da6c9ebc36311a2e0eb52338fe893a1666a8a55675173b675bffa81bee06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:08:40,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:08:40,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:08:40,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:08:40,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:08:40,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:08:40,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:08:40,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:08:40,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:08:40,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:08:40,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:08:40,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:08:40,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:08:40,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:08:40,118 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:08:40,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:08:40,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:08:40,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:40,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:08:40,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:08:40,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:08:40,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:08:40,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:08:40,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:08:40,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:08:40,121 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 -> 0dc7da6c9ebc36311a2e0eb52338fe893a1666a8a55675173b675bffa81bee06 [2025-03-16 14:08:40,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:08:40,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:08:40,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:08:40,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:08:40,347 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:08:40,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label33.c [2025-03-16 14:08:41,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f4f3261/c53490282e5849898ff7590756c13110/FLAG42b0b3631 [2025-03-16 14:08:41,857 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:08:41,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label33.c [2025-03-16 14:08:41,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f4f3261/c53490282e5849898ff7590756c13110/FLAG42b0b3631 [2025-03-16 14:08:41,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f4f3261/c53490282e5849898ff7590756c13110 [2025-03-16 14:08:41,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:08:41,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:08:41,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:41,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:08:41,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:08:41,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:41" (1/1) ... [2025-03-16 14:08:41,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f67c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:41, skipping insertion in model container [2025-03-16 14:08:41,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:41" (1/1) ... [2025-03-16 14:08:41,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:08:42,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label33.c[21447,21460] [2025-03-16 14:08:42,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:42,196 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:08:42,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label33.c[21447,21460] [2025-03-16 14:08:42,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:42,264 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:08:42,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42 WrapperNode [2025-03-16 14:08:42,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:42,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:42,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:08:42,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:08:42,272 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:08:42" (1/1) ... [2025-03-16 14:08:42,281 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:08:42" (1/1) ... [2025-03-16 14:08:42,315 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-16 14:08:42,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:42,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:08:42,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:08:42,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:08:42,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,342 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:08:42,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:08:42,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:08:42,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:08:42,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:08:42,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (1/1) ... [2025-03-16 14:08:42,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:42,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:42,394 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:08:42,397 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:08:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:08:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:08:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:08:42,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:08:42,460 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:08:42,461 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:08:43,175 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 14:08:43,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:08:43,185 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:08:43,185 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:08:43,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:43 BoogieIcfgContainer [2025-03-16 14:08:43,186 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:08:43,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:08:43,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:08:43,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:08:43,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:08:41" (1/3) ... [2025-03-16 14:08:43,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc9125b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:43, skipping insertion in model container [2025-03-16 14:08:43,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:42" (2/3) ... [2025-03-16 14:08:43,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc9125b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:43, skipping insertion in model container [2025-03-16 14:08:43,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:43" (3/3) ... [2025-03-16 14:08:43,193 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label33.c [2025-03-16 14:08:43,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:08:43,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label33.c that has 1 procedures, 166 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:08:43,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:08:43,246 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;@7dd172e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:08:43,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:08:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 164 states have (on average 1.9085365853658536) internal successors, (313), 165 states have internal predecessors, (313), 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:08:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 14:08:43,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:43,256 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] [2025-03-16 14:08:43,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:43,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash 764197651, now seen corresponding path program 1 times [2025-03-16 14:08:43,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:43,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915349724] [2025-03-16 14:08:43,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:43,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:43,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 14:08:43,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 14:08:43,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:43,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:43,599 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:08:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915349724] [2025-03-16 14:08:43,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915349724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:43,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:43,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926329615] [2025-03-16 14:08:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:43,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:08:43,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:43,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:08:43,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:08:43,621 INFO L87 Difference]: Start difference. First operand has 166 states, 164 states have (on average 1.9085365853658536) internal successors, (313), 165 states have internal predecessors, (313), 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 70.0) internal successors, (140), 2 states have internal predecessors, (140), 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:08:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:43,650 INFO L93 Difference]: Finished difference Result 331 states and 625 transitions. [2025-03-16 14:08:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:08:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 70.0) internal successors, (140), 2 states have internal predecessors, (140), 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 140 [2025-03-16 14:08:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:43,661 INFO L225 Difference]: With dead ends: 331 [2025-03-16 14:08:43,661 INFO L226 Difference]: Without dead ends: 163 [2025-03-16 14:08:43,663 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:08:43,667 INFO L435 NwaCegarLoop]: 251 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, 251 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:08:43,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:08:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-16 14:08:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-16 14:08:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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:08:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2025-03-16 14:08:43,708 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 140 [2025-03-16 14:08:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:43,708 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2025-03-16 14:08:43,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.0) internal successors, (140), 2 states have internal predecessors, (140), 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:08:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2025-03-16 14:08:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 14:08:43,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:43,712 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] [2025-03-16 14:08:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:08:43,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:43,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash -817580333, now seen corresponding path program 1 times [2025-03-16 14:08:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362149248] [2025-03-16 14:08:43,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:43,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 14:08:43,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 14:08:43,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:43,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:44,037 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:08:44,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:44,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362149248] [2025-03-16 14:08:44,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362149248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:44,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:44,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:44,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488697190] [2025-03-16 14:08:44,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:44,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:44,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:44,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:44,043 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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:08:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:44,553 INFO L93 Difference]: Finished difference Result 470 states and 719 transitions. [2025-03-16 14:08:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:44,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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 140 [2025-03-16 14:08:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:44,556 INFO L225 Difference]: With dead ends: 470 [2025-03-16 14:08:44,556 INFO L226 Difference]: Without dead ends: 308 [2025-03-16 14:08:44,557 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:08:44,557 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:44,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 117 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:08:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-16 14:08:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2025-03-16 14:08:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.3311475409836067) internal successors, (406), 305 states have internal predecessors, (406), 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:08:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 406 transitions. [2025-03-16 14:08:44,576 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 406 transitions. Word has length 140 [2025-03-16 14:08:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:44,576 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 406 transitions. [2025-03-16 14:08:44,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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:08:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 406 transitions. [2025-03-16 14:08:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 14:08:44,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:44,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:44,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:08:44,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:44,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1250870304, now seen corresponding path program 1 times [2025-03-16 14:08:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335225276] [2025-03-16 14:08:44,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:44,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:44,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 14:08:44,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 14:08:44,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:44,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335225276] [2025-03-16 14:08:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335225276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:44,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:44,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877099002] [2025-03-16 14:08:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:44,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:44,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:44,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:44,808 INFO L87 Difference]: Start difference. First operand 306 states and 406 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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:08:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:45,203 INFO L93 Difference]: Finished difference Result 757 states and 1033 transitions. [2025-03-16 14:08:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 145 [2025-03-16 14:08:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:45,206 INFO L225 Difference]: With dead ends: 757 [2025-03-16 14:08:45,206 INFO L226 Difference]: Without dead ends: 452 [2025-03-16 14:08:45,207 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:08:45,207 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:45,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-16 14:08:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2025-03-16 14:08:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.2793791574279378) internal successors, (577), 451 states have internal predecessors, (577), 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:08:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 577 transitions. [2025-03-16 14:08:45,224 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 577 transitions. Word has length 145 [2025-03-16 14:08:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:45,225 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 577 transitions. [2025-03-16 14:08:45,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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:08:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 577 transitions. [2025-03-16 14:08:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 14:08:45,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:45,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:45,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:08:45,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:45,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1818171983, now seen corresponding path program 1 times [2025-03-16 14:08:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157371369] [2025-03-16 14:08:45,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:45,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 14:08:45,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 14:08:45,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:45,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:45,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:45,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157371369] [2025-03-16 14:08:45,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157371369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:45,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:45,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:45,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383190604] [2025-03-16 14:08:45,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:45,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:45,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:45,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:45,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:45,343 INFO L87 Difference]: Start difference. First operand 452 states and 577 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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:08:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:45,691 INFO L93 Difference]: Finished difference Result 1324 states and 1690 transitions. [2025-03-16 14:08:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:45,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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 157 [2025-03-16 14:08:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:45,694 INFO L225 Difference]: With dead ends: 1324 [2025-03-16 14:08:45,694 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 14:08:45,695 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:08:45,695 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:45,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 81 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 14:08:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-03-16 14:08:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.2293577981651376) internal successors, (1072), 872 states have internal predecessors, (1072), 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:08:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1072 transitions. [2025-03-16 14:08:45,711 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1072 transitions. Word has length 157 [2025-03-16 14:08:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:45,711 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1072 transitions. [2025-03-16 14:08:45,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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:08:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1072 transitions. [2025-03-16 14:08:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 14:08:45,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:45,718 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:08:45,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:08:45,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:45,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash 861246572, now seen corresponding path program 1 times [2025-03-16 14:08:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:45,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946929228] [2025-03-16 14:08:45,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:45,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 14:08:45,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 14:08:45,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:45,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:08:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946929228] [2025-03-16 14:08:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946929228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628141024] [2025-03-16 14:08:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:45,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:45,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:45,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:45,829 INFO L87 Difference]: Start difference. First operand 873 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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:08:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:46,153 INFO L93 Difference]: Finished difference Result 2027 states and 2467 transitions. [2025-03-16 14:08:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:46,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 186 [2025-03-16 14:08:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:46,157 INFO L225 Difference]: With dead ends: 2027 [2025-03-16 14:08:46,158 INFO L226 Difference]: Without dead ends: 1013 [2025-03-16 14:08:46,159 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:08:46,161 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:46,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 64 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-16 14:08:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1011. [2025-03-16 14:08:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.1425742574257425) internal successors, (1154), 1010 states have internal predecessors, (1154), 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:08:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1154 transitions. [2025-03-16 14:08:46,182 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1154 transitions. Word has length 186 [2025-03-16 14:08:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:46,183 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1154 transitions. [2025-03-16 14:08:46,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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:08:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1154 transitions. [2025-03-16 14:08:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-16 14:08:46,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:46,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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:08:46,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:08:46,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:46,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash 976823586, now seen corresponding path program 1 times [2025-03-16 14:08:46,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:46,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241509269] [2025-03-16 14:08:46,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:46,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:46,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 14:08:46,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 14:08:46,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:46,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:08:46,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:46,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241509269] [2025-03-16 14:08:46,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241509269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:46,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:08:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824556446] [2025-03-16 14:08:46,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:46,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:08:46,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:46,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:08:46,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:46,470 INFO L87 Difference]: Start difference. First operand 1011 states and 1154 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 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:08:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:47,090 INFO L93 Difference]: Finished difference Result 2581 states and 2921 transitions. [2025-03-16 14:08:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:08:47,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 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 190 [2025-03-16 14:08:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:47,095 INFO L225 Difference]: With dead ends: 2581 [2025-03-16 14:08:47,095 INFO L226 Difference]: Without dead ends: 1571 [2025-03-16 14:08:47,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:47,097 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 327 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:47,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 150 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:08:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-03-16 14:08:47,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1431. [2025-03-16 14:08:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 1.1167832167832168) internal successors, (1597), 1430 states have internal predecessors, (1597), 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:08:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1597 transitions. [2025-03-16 14:08:47,120 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1597 transitions. Word has length 190 [2025-03-16 14:08:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:47,120 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1597 transitions. [2025-03-16 14:08:47,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 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:08:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1597 transitions. [2025-03-16 14:08:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-16 14:08:47,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:47,123 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, 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] [2025-03-16 14:08:47,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:08:47,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2079737507, now seen corresponding path program 1 times [2025-03-16 14:08:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:47,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946455667] [2025-03-16 14:08:47,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:47,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:47,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 14:08:47,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 14:08:47,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:47,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:47,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946455667] [2025-03-16 14:08:47,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946455667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:47,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:47,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146137068] [2025-03-16 14:08:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:47,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:47,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:47,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:47,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:47,203 INFO L87 Difference]: Start difference. First operand 1431 states and 1597 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:08:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:47,523 INFO L93 Difference]: Finished difference Result 3699 states and 4159 transitions. [2025-03-16 14:08:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:47,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2025-03-16 14:08:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:47,530 INFO L225 Difference]: With dead ends: 3699 [2025-03-16 14:08:47,530 INFO L226 Difference]: Without dead ends: 2269 [2025-03-16 14:08:47,531 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:08:47,532 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 140 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:47,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 63 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2025-03-16 14:08:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1709. [2025-03-16 14:08:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 1.1229508196721312) internal successors, (1918), 1708 states have internal predecessors, (1918), 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:08:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 1918 transitions. [2025-03-16 14:08:47,594 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 1918 transitions. Word has length 212 [2025-03-16 14:08:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:47,594 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 1918 transitions. [2025-03-16 14:08:47,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:08:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 1918 transitions. [2025-03-16 14:08:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-16 14:08:47,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:47,598 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:08:47,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:08:47,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:47,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1759153645, now seen corresponding path program 1 times [2025-03-16 14:08:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145575084] [2025-03-16 14:08:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-16 14:08:47,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-16 14:08:47,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:47,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 14:08:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145575084] [2025-03-16 14:08:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145575084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:47,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:47,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:47,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248557871] [2025-03-16 14:08:47,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:47,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:47,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:47,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:47,721 INFO L87 Difference]: Start difference. First operand 1709 states and 1918 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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:08:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:48,032 INFO L93 Difference]: Finished difference Result 3831 states and 4278 transitions. [2025-03-16 14:08:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:48,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 233 [2025-03-16 14:08:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:48,037 INFO L225 Difference]: With dead ends: 3831 [2025-03-16 14:08:48,037 INFO L226 Difference]: Without dead ends: 1703 [2025-03-16 14:08:48,038 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:08:48,039 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 81 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:48,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 230 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2025-03-16 14:08:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1563. [2025-03-16 14:08:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1562 states have (on average 1.0717029449423816) internal successors, (1674), 1562 states have internal predecessors, (1674), 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:08:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1674 transitions. [2025-03-16 14:08:48,061 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1674 transitions. Word has length 233 [2025-03-16 14:08:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:48,061 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 1674 transitions. [2025-03-16 14:08:48,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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:08:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1674 transitions. [2025-03-16 14:08:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 14:08:48,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:48,064 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, 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] [2025-03-16 14:08:48,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:08:48,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:48,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1380488814, now seen corresponding path program 1 times [2025-03-16 14:08:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:48,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415291655] [2025-03-16 14:08:48,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:48,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 14:08:48,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 14:08:48,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:48,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:48,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:48,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415291655] [2025-03-16 14:08:48,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415291655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:08:48,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641899127] [2025-03-16 14:08:48,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:48,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:08:48,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:48,339 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:08:48,341 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:08:48,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 14:08:48,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 14:08:48,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:48,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:48,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:08:48,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:08:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 14:08:48,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:08:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641899127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:48,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:08:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:08:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128215719] [2025-03-16 14:08:48,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:48,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:48,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:48,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:48,609 INFO L87 Difference]: Start difference. First operand 1563 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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:08:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:48,893 INFO L93 Difference]: Finished difference Result 3405 states and 3644 transitions. [2025-03-16 14:08:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:48,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 238 [2025-03-16 14:08:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:48,897 INFO L225 Difference]: With dead ends: 3405 [2025-03-16 14:08:48,897 INFO L226 Difference]: Without dead ends: 1423 [2025-03-16 14:08:48,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:48,901 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:48,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-16 14:08:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1283. [2025-03-16 14:08:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 1.0569422776911077) internal successors, (1355), 1282 states have internal predecessors, (1355), 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:08:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1355 transitions. [2025-03-16 14:08:48,920 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1355 transitions. Word has length 238 [2025-03-16 14:08:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:48,920 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1355 transitions. [2025-03-16 14:08:48,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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:08:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1355 transitions. [2025-03-16 14:08:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 14:08:48,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:48,923 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:08:48,930 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:08:49,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:08:49,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:49,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:49,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1817656712, now seen corresponding path program 1 times [2025-03-16 14:08:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:49,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010920817] [2025-03-16 14:08:49,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:49,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:49,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-16 14:08:49,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 14:08:49,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:08:49,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010920817] [2025-03-16 14:08:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010920817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:49,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90322061] [2025-03-16 14:08:49,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:49,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:49,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:49,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:49,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:49,242 INFO L87 Difference]: Start difference. First operand 1283 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:08:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:49,518 INFO L93 Difference]: Finished difference Result 3131 states and 3302 transitions. [2025-03-16 14:08:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:49,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 260 [2025-03-16 14:08:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:49,523 INFO L225 Difference]: With dead ends: 3131 [2025-03-16 14:08:49,524 INFO L226 Difference]: Without dead ends: 1709 [2025-03-16 14:08:49,525 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:08:49,526 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 87 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:49,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 212 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-03-16 14:08:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1705. [2025-03-16 14:08:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1704 states have (on average 1.045774647887324) internal successors, (1782), 1704 states have internal predecessors, (1782), 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:08:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 1782 transitions. [2025-03-16 14:08:49,557 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 1782 transitions. Word has length 260 [2025-03-16 14:08:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:49,558 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 1782 transitions. [2025-03-16 14:08:49,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:08:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 1782 transitions. [2025-03-16 14:08:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 14:08:49,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:49,562 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:08:49,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1588922592, now seen corresponding path program 1 times [2025-03-16 14:08:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261469663] [2025-03-16 14:08:49,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:49,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:08:49,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:08:49,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:49,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-16 14:08:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261469663] [2025-03-16 14:08:49,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261469663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:49,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:49,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732712589] [2025-03-16 14:08:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:49,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:49,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:49,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:49,673 INFO L87 Difference]: Start difference. First operand 1705 states and 1782 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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:08:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:49,956 INFO L93 Difference]: Finished difference Result 3550 states and 3729 transitions. [2025-03-16 14:08:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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:08:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:49,961 INFO L225 Difference]: With dead ends: 3550 [2025-03-16 14:08:49,962 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 14:08:49,963 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:08:49,964 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 127 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:49,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 188 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 14:08:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1843. [2025-03-16 14:08:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1842 states have (on average 1.0439739413680782) internal successors, (1923), 1842 states have internal predecessors, (1923), 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:08:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 1923 transitions. [2025-03-16 14:08:49,989 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 1923 transitions. Word has length 268 [2025-03-16 14:08:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:49,989 INFO L471 AbstractCegarLoop]: Abstraction has 1843 states and 1923 transitions. [2025-03-16 14:08:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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:08:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 1923 transitions. [2025-03-16 14:08:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 14:08:49,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:49,992 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:08:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:08:49,993 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:49,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:49,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1848871774, now seen corresponding path program 1 times [2025-03-16 14:08:49,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:49,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149420846] [2025-03-16 14:08:49,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:50,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 14:08:50,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 14:08:50,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:50,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:08:50,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149420846] [2025-03-16 14:08:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149420846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904409627] [2025-03-16 14:08:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:50,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:50,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:50,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:50,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:50,129 INFO L87 Difference]: Start difference. First operand 1843 states and 1923 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:08:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:50,387 INFO L93 Difference]: Finished difference Result 3404 states and 3547 transitions. [2025-03-16 14:08:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 277 [2025-03-16 14:08:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:50,393 INFO L225 Difference]: With dead ends: 3404 [2025-03-16 14:08:50,393 INFO L226 Difference]: Without dead ends: 1702 [2025-03-16 14:08:50,395 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:08:50,395 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:50,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:08:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-03-16 14:08:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1701. [2025-03-16 14:08:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.0305882352941176) internal successors, (1752), 1700 states have internal predecessors, (1752), 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:08:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 1752 transitions. [2025-03-16 14:08:50,416 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 1752 transitions. Word has length 277 [2025-03-16 14:08:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:50,416 INFO L471 AbstractCegarLoop]: Abstraction has 1701 states and 1752 transitions. [2025-03-16 14:08:50,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:08:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 1752 transitions. [2025-03-16 14:08:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-16 14:08:50,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:50,419 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, 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, 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:08:50,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:08:50,420 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:50,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1104601431, now seen corresponding path program 1 times [2025-03-16 14:08:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:50,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995662248] [2025-03-16 14:08:50,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:50,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:50,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-16 14:08:50,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-16 14:08:50,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:50,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:50,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995662248] [2025-03-16 14:08:50,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995662248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:50,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:50,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:08:50,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460719035] [2025-03-16 14:08:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:50,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:08:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:50,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:08:50,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:08:50,589 INFO L87 Difference]: Start difference. First operand 1701 states and 1752 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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:08:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:50,849 INFO L93 Difference]: Finished difference Result 3262 states and 3362 transitions. [2025-03-16 14:08:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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 291 [2025-03-16 14:08:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:50,853 INFO L225 Difference]: With dead ends: 3262 [2025-03-16 14:08:50,853 INFO L226 Difference]: Without dead ends: 1416 [2025-03-16 14:08:50,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:08:50,855 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 179 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:50,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 203 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:08:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-16 14:08:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1274. [2025-03-16 14:08:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 1.021209740769835) internal successors, (1300), 1273 states have internal predecessors, (1300), 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:08:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1300 transitions. [2025-03-16 14:08:50,870 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1300 transitions. Word has length 291 [2025-03-16 14:08:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:50,870 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1300 transitions. [2025-03-16 14:08:50,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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:08:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1300 transitions. [2025-03-16 14:08:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 14:08:50,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:50,873 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:50,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:08:50,874 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:50,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash -989323015, now seen corresponding path program 1 times [2025-03-16 14:08:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:50,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970383474] [2025-03-16 14:08:50,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:50,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 14:08:50,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 14:08:50,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:50,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 243 proven. 101 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:08:51,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:51,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970383474] [2025-03-16 14:08:51,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970383474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:08:51,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733986070] [2025-03-16 14:08:51,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:51,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:08:51,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:51,027 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:08:51,028 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:08:51,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 14:08:51,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 14:08:51,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:51,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:51,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:08:51,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:08:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-16 14:08:51,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:08:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733986070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:08:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 14:08:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566489486] [2025-03-16 14:08:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:51,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:51,331 INFO L87 Difference]: Start difference. First operand 1274 states and 1300 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 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:08:51,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:51,453 INFO L93 Difference]: Finished difference Result 1836 states and 1877 transitions. [2025-03-16 14:08:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:51,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 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 324 [2025-03-16 14:08:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:51,454 INFO L225 Difference]: With dead ends: 1836 [2025-03-16 14:08:51,454 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:08:51,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:51,456 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:51,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 7 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:08:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:08:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:08:51,457 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:08:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:08:51,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2025-03-16 14:08:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:51,457 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:08:51,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 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:08:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:08:51,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:08:51,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:08:51,468 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:08:51,660 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,SelfDestructingSolverStorable13 [2025-03-16 14:08:51,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:51,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:08:51,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:08:51,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:08:51 BoogieIcfgContainer [2025-03-16 14:08:51,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:08:51,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:08:51,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:08:51,905 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:08:51,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:43" (3/4) ... [2025-03-16 14:08:51,907 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:08:51,919 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:08:51,920 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:08:51,920 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:08:51,921 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:08:52,028 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:08:52,028 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:08:52,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:08:52,029 INFO L158 Benchmark]: Toolchain (without parser) took 10125.20ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 110.7MB in the beginning and 183.2MB in the end (delta: -72.5MB). Peak memory consumption was 250.7MB. Max. memory is 16.1GB. [2025-03-16 14:08:52,029 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:52,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.47ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 84.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:08:52,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.80ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 79.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:08:52,030 INFO L158 Benchmark]: Boogie Preprocessor took 49.62ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 76.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:52,030 INFO L158 Benchmark]: IcfgBuilder took 819.96ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 71.5MB in the end (delta: 4.6MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2025-03-16 14:08:52,030 INFO L158 Benchmark]: TraceAbstraction took 8717.05ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 71.5MB in the beginning and 195.6MB in the end (delta: -124.1MB). Peak memory consumption was 201.0MB. Max. memory is 16.1GB. [2025-03-16 14:08:52,030 INFO L158 Benchmark]: Witness Printer took 123.28ms. Allocated memory is still 469.8MB. Free memory was 195.6MB in the beginning and 183.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:08:52,032 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.33ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.47ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 84.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.80ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 79.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.62ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 76.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 819.96ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 71.5MB in the end (delta: 4.6MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8717.05ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 71.5MB in the beginning and 195.6MB in the end (delta: -124.1MB). Peak memory consumption was 201.0MB. Max. memory is 16.1GB. * Witness Printer took 123.28ms. Allocated memory is still 469.8MB. Free memory was 195.6MB in the beginning and 183.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 605]: 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, 166 locations, 313 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1405 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1405 mSDsluCounter, 2083 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 230 mSDsCounter, 640 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4718 IncrementalHoareTripleChecker+Invalid, 5358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 640 mSolverCounterUnsat, 1853 mSDtfsCounter, 4718 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 604 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1843occurred in iteration=11, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1131 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 3623 NumberOfCodeBlocks, 3623 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3607 ConstructedInterpolants, 0 QuantifiedInterpolants, 8682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 858 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 2047/2206 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Location Invariant Derived location invariant: ((((((((((((a11 == 1) && (a17 <= 7)) && (a28 <= 10)) || ((a17 <= 7) && (a28 == 10))) || ((((((a17 == 8) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) || (((a28 <= 10) && (a19 == 1)) && (a11 != 1))) && (a17 <= 8))) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || ((a25 == 1) && (((((a17 == 8) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) || (((a28 <= 10) && (a19 == 1)) && (a11 != 1))))) || ((a28 == 10) && (a19 == 1))) || ((a17 <= 8) && (a28 <= 7))) || (((a28 <= 8) && (a17 <= 8)) && (a11 != 1))) || ((a17 <= 7) && (a19 == 1))) || ((a25 == 1) && (a28 == 10))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:08:52,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE