./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label44.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 615f5d053860bb060d59c74904029b4b08523188eca53d2f384305e3b3f0c7ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:02:00,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:02:00,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:02:00,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:02:00,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:02:00,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:02:00,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:02:00,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:02:00,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:02:00,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:02:00,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:02:00,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:02:00,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:02:00,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:02:00,222 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:02:00,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:02:00,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:02:00,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:02:00,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:02:00,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:02:00,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:02:00,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:02:00,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:02:00,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:02:00,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:02:00,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:02:00,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:02:00,227 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 -> 615f5d053860bb060d59c74904029b4b08523188eca53d2f384305e3b3f0c7ed [2025-03-08 02:02:00,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:02:00,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:02:00,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:02:00,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:02:00,461 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:02:00,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label44.c [2025-03-08 02:02:01,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df266660/bb0a588dacf74d9781c394caac8a2a4f/FLAG7538a8dca [2025-03-08 02:02:01,950 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:02:01,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label44.c [2025-03-08 02:02:01,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df266660/bb0a588dacf74d9781c394caac8a2a4f/FLAG7538a8dca [2025-03-08 02:02:02,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df266660/bb0a588dacf74d9781c394caac8a2a4f [2025-03-08 02:02:02,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:02:02,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:02:02,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:02:02,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:02:02,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:02:02,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:02,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f766ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02, skipping insertion in model container [2025-03-08 02:02:02,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:02,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:02:02,437 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/Problem15_label44.c[8025,8038] [2025-03-08 02:02:02,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:02:02,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:02:02,767 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/Problem15_label44.c[8025,8038] [2025-03-08 02:02:02,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:02:02,902 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:02:02,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02 WrapperNode [2025-03-08 02:02:02,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:02:02,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:02:02,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:02:02,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:02:02,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:02,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,069 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-08 02:02:03,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:02:03,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:02:03,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:02:03,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:02:03,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,199 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:02:03,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:02:03,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:02:03,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:02:03,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:02:03,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (1/1) ... [2025-03-08 02:02:03,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:02:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:02:03,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:02:03,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:02:03,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:02:03,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:02:03,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:02:03,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:02:03,391 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:02:03,392 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:02:05,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-08 02:02:05,484 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-08 02:02:05,484 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:02:05,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:02:05,507 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:02:05,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:05 BoogieIcfgContainer [2025-03-08 02:02:05,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:02:05,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:02:05,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:02:05,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:02:05,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:02:02" (1/3) ... [2025-03-08 02:02:05,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e641ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:02:05, skipping insertion in model container [2025-03-08 02:02:05,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:02:02" (2/3) ... [2025-03-08 02:02:05,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e641ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:02:05, skipping insertion in model container [2025-03-08 02:02:05,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:05" (3/3) ... [2025-03-08 02:02:05,515 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label44.c [2025-03-08 02:02:05,529 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:02:05,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label44.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:02:05,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:02:05,606 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;@76b737fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:02:05,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:02:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 02:02:05,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:05,623 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] [2025-03-08 02:02:05,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:05,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash -675760220, now seen corresponding path program 1 times [2025-03-08 02:02:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:05,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855244456] [2025-03-08 02:02:05,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:05,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 02:02:05,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 02:02:05,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:05,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855244456] [2025-03-08 02:02:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855244456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:05,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:05,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:02:05,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207442016] [2025-03-08 02:02:05,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:05,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:05,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:06,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:06,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:06,010 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:07,507 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-03-08 02:02:07,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:07,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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 66 [2025-03-08 02:02:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:07,519 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 02:02:07,519 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 02:02:07,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:07,523 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 255 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:07,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 385 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:02:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 02:02:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-03-08 02:02:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-03-08 02:02:07,569 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 66 [2025-03-08 02:02:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:07,569 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-03-08 02:02:07,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-03-08 02:02:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 02:02:07,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:07,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:02:07,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:07,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2025128248, now seen corresponding path program 1 times [2025-03-08 02:02:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:07,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377058146] [2025-03-08 02:02:07,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:07,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 02:02:07,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 02:02:07,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:07,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:07,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377058146] [2025-03-08 02:02:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377058146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:07,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:07,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:02:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991666938] [2025-03-08 02:02:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:07,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:07,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:07,926 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:09,038 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-03-08 02:02:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 131 [2025-03-08 02:02:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:09,041 INFO L225 Difference]: With dead ends: 1624 [2025-03-08 02:02:09,042 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 02:02:09,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:09,043 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:09,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:02:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 02:02:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-03-08 02:02:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-03-08 02:02:09,070 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 131 [2025-03-08 02:02:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:09,070 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-03-08 02:02:09,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-03-08 02:02:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 02:02:09,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:09,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:09,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:02:09,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:09,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1462010781, now seen corresponding path program 1 times [2025-03-08 02:02:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:09,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993200557] [2025-03-08 02:02:09,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:09,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 02:02:09,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 02:02:09,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:09,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:09,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993200557] [2025-03-08 02:02:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993200557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:09,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:09,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:02:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129650493] [2025-03-08 02:02:09,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:09,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:02:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:09,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:02:09,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:02:09,358 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:10,886 INFO L93 Difference]: Finished difference Result 2240 states and 3197 transitions. [2025-03-08 02:02:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:02:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 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 136 [2025-03-08 02:02:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:10,895 INFO L225 Difference]: With dead ends: 2240 [2025-03-08 02:02:10,895 INFO L226 Difference]: Without dead ends: 1578 [2025-03-08 02:02:10,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:02:10,901 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 934 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:10,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 326 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:02:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-08 02:02:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1266. [2025-03-08 02:02:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-03-08 02:02:10,937 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 136 [2025-03-08 02:02:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:10,938 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-03-08 02:02:10,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-03-08 02:02:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 02:02:10,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:10,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:02:10,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:02:10,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:10,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash 916702865, now seen corresponding path program 1 times [2025-03-08 02:02:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:10,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92903897] [2025-03-08 02:02:10,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:10,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 02:02:11,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 02:02:11,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:11,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:11,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92903897] [2025-03-08 02:02:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92903897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:11,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:11,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263358778] [2025-03-08 02:02:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:11,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:02:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:11,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:02:11,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:02:11,194 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:13,584 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2025-03-08 02:02:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:02:13,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-08 02:02:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:13,596 INFO L225 Difference]: With dead ends: 4670 [2025-03-08 02:02:13,596 INFO L226 Difference]: Without dead ends: 3406 [2025-03-08 02:02:13,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:02:13,601 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 486 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:13,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 377 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:02:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-03-08 02:02:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2025-03-08 02:02:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2025-03-08 02:02:13,672 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 232 [2025-03-08 02:02:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:13,672 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2025-03-08 02:02:13,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2025-03-08 02:02:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-08 02:02:13,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:13,675 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:02:13,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:02:13,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:13,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 951472775, now seen corresponding path program 1 times [2025-03-08 02:02:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:13,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289001143] [2025-03-08 02:02:13,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:13,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-08 02:02:13,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-08 02:02:13,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:13,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:02:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289001143] [2025-03-08 02:02:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289001143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:02:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076110282] [2025-03-08 02:02:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:13,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:13,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:13,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:13,824 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:14,954 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2025-03-08 02:02:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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 236 [2025-03-08 02:02:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:14,969 INFO L225 Difference]: With dead ends: 8563 [2025-03-08 02:02:14,969 INFO L226 Difference]: Without dead ends: 5483 [2025-03-08 02:02:14,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:14,973 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:14,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 340 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:02:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-03-08 02:02:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-03-08 02:02:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2025-03-08 02:02:15,064 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 236 [2025-03-08 02:02:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:15,064 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2025-03-08 02:02:15,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2025-03-08 02:02:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-08 02:02:15,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:15,071 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:02:15,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:02:15,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:15,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash -178184861, now seen corresponding path program 1 times [2025-03-08 02:02:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:15,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146119595] [2025-03-08 02:02:15,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:15,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-08 02:02:15,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-08 02:02:15,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:15,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 02:02:15,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:15,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146119595] [2025-03-08 02:02:15,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146119595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:15,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:15,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:02:15,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692812342] [2025-03-08 02:02:15,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:15,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:15,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:15,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:15,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:15,507 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:16,485 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2025-03-08 02:02:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:16,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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 338 [2025-03-08 02:02:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:16,497 INFO L225 Difference]: With dead ends: 10655 [2025-03-08 02:02:16,498 INFO L226 Difference]: Without dead ends: 5478 [2025-03-08 02:02:16,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:16,504 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:16,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:02:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-03-08 02:02:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-03-08 02:02:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2025-03-08 02:02:16,592 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 338 [2025-03-08 02:02:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:16,593 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2025-03-08 02:02:16,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2025-03-08 02:02:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-08 02:02:16,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:16,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:02:16,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1307045588, now seen corresponding path program 1 times [2025-03-08 02:02:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550068631] [2025-03-08 02:02:16,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:16,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-08 02:02:16,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-08 02:02:16,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:16,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 02:02:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550068631] [2025-03-08 02:02:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550068631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:16,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026872690] [2025-03-08 02:02:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:16,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:16,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:16,782 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:18,423 INFO L93 Difference]: Finished difference Result 11851 states and 14151 transitions. [2025-03-08 02:02:18,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:18,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 353 [2025-03-08 02:02:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:18,438 INFO L225 Difference]: With dead ends: 11851 [2025-03-08 02:02:18,438 INFO L226 Difference]: Without dead ends: 6674 [2025-03-08 02:02:18,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:18,444 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 249 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:18,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 324 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:02:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-03-08 02:02:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4876. [2025-03-08 02:02:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.1805128205128206) internal successors, (5755), 4875 states have internal predecessors, (5755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5755 transitions. [2025-03-08 02:02:18,529 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5755 transitions. Word has length 353 [2025-03-08 02:02:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:18,529 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 5755 transitions. [2025-03-08 02:02:18,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5755 transitions. [2025-03-08 02:02:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-08 02:02:18,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:18,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:18,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:02:18,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:18,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:18,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1354147785, now seen corresponding path program 1 times [2025-03-08 02:02:18,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:18,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408345989] [2025-03-08 02:02:18,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:18,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 02:02:18,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 02:02:18,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-08 02:02:18,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:18,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408345989] [2025-03-08 02:02:18,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408345989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:18,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:18,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:18,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806956596] [2025-03-08 02:02:18,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:18,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:18,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:18,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:18,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:18,782 INFO L87 Difference]: Start difference. First operand 4876 states and 5755 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:19,868 INFO L93 Difference]: Finished difference Result 11852 states and 14244 transitions. [2025-03-08 02:02:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:19,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 412 [2025-03-08 02:02:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:19,886 INFO L225 Difference]: With dead ends: 11852 [2025-03-08 02:02:19,886 INFO L226 Difference]: Without dead ends: 7277 [2025-03-08 02:02:19,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:19,891 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 262 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:19,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:02:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2025-03-08 02:02:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 6380. [2025-03-08 02:02:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.1558237968333596) internal successors, (7373), 6379 states have internal predecessors, (7373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7373 transitions. [2025-03-08 02:02:19,973 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7373 transitions. Word has length 412 [2025-03-08 02:02:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:19,974 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7373 transitions. [2025-03-08 02:02:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7373 transitions. [2025-03-08 02:02:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-03-08 02:02:19,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:19,985 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:19,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:02:19,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:19,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 333822525, now seen corresponding path program 1 times [2025-03-08 02:02:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318411492] [2025-03-08 02:02:19,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:20,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-08 02:02:20,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-08 02:02:20,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:20,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:02:20,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:20,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318411492] [2025-03-08 02:02:20,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318411492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:20,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:20,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:20,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759032036] [2025-03-08 02:02:20,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:20,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:20,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:20,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:20,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:20,263 INFO L87 Difference]: Start difference. First operand 6380 states and 7373 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:21,410 INFO L93 Difference]: Finished difference Result 14563 states and 17152 transitions. [2025-03-08 02:02:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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 418 [2025-03-08 02:02:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:21,422 INFO L225 Difference]: With dead ends: 14563 [2025-03-08 02:02:21,422 INFO L226 Difference]: Without dead ends: 8484 [2025-03-08 02:02:21,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:21,427 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 250 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:21,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 602 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:02:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2025-03-08 02:02:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 8182. [2025-03-08 02:02:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8182 states, 8181 states have (on average 1.135558000244469) internal successors, (9290), 8181 states have internal predecessors, (9290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8182 states to 8182 states and 9290 transitions. [2025-03-08 02:02:21,502 INFO L78 Accepts]: Start accepts. Automaton has 8182 states and 9290 transitions. Word has length 418 [2025-03-08 02:02:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:21,503 INFO L471 AbstractCegarLoop]: Abstraction has 8182 states and 9290 transitions. [2025-03-08 02:02:21,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 8182 states and 9290 transitions. [2025-03-08 02:02:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 02:02:21,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:21,506 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:02:21,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:02:21,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:21,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1450707947, now seen corresponding path program 1 times [2025-03-08 02:02:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:21,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583612297] [2025-03-08 02:02:21,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:21,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:21,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 02:02:21,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 02:02:21,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:21,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 02:02:21,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:21,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583612297] [2025-03-08 02:02:21,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583612297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:21,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:21,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:21,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127068867] [2025-03-08 02:02:21,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:21,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:21,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:21,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:21,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:21,779 INFO L87 Difference]: Start difference. First operand 8182 states and 9290 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:23,031 INFO L93 Difference]: Finished difference Result 17857 states and 20650 transitions. [2025-03-08 02:02:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:23,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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 434 [2025-03-08 02:02:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:23,045 INFO L225 Difference]: With dead ends: 17857 [2025-03-08 02:02:23,046 INFO L226 Difference]: Without dead ends: 9976 [2025-03-08 02:02:23,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:23,053 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 245 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:23,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:02:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9976 states. [2025-03-08 02:02:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9976 to 9673. [2025-03-08 02:02:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9673 states, 9672 states have (on average 1.1267576509511994) internal successors, (10898), 9672 states have internal predecessors, (10898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9673 states to 9673 states and 10898 transitions. [2025-03-08 02:02:23,135 INFO L78 Accepts]: Start accepts. Automaton has 9673 states and 10898 transitions. Word has length 434 [2025-03-08 02:02:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 9673 states and 10898 transitions. [2025-03-08 02:02:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 9673 states and 10898 transitions. [2025-03-08 02:02:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-08 02:02:23,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:23,141 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:23,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:02:23,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:23,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1603960683, now seen corresponding path program 1 times [2025-03-08 02:02:23,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:23,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753941083] [2025-03-08 02:02:23,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:23,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:23,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-08 02:02:23,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-08 02:02:23,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:23,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-08 02:02:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753941083] [2025-03-08 02:02:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753941083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:23,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:23,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817814250] [2025-03-08 02:02:23,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:23,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:23,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:23,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:23,406 INFO L87 Difference]: Start difference. First operand 9673 states and 10898 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:24,313 INFO L93 Difference]: Finished difference Result 21436 states and 24446 transitions. [2025-03-08 02:02:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:24,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 530 [2025-03-08 02:02:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:24,331 INFO L225 Difference]: With dead ends: 21436 [2025-03-08 02:02:24,332 INFO L226 Difference]: Without dead ends: 12064 [2025-03-08 02:02:24,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:24,342 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 349 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:24,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:02:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12064 states. [2025-03-08 02:02:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12064 to 12064. [2025-03-08 02:02:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12064 states, 12063 states have (on average 1.1321396004310702) internal successors, (13657), 12063 states have internal predecessors, (13657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12064 states to 12064 states and 13657 transitions. [2025-03-08 02:02:24,498 INFO L78 Accepts]: Start accepts. Automaton has 12064 states and 13657 transitions. Word has length 530 [2025-03-08 02:02:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:24,499 INFO L471 AbstractCegarLoop]: Abstraction has 12064 states and 13657 transitions. [2025-03-08 02:02:24,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 12064 states and 13657 transitions. [2025-03-08 02:02:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-03-08 02:02:24,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:24,504 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:24,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:02:24,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1734971350, now seen corresponding path program 1 times [2025-03-08 02:02:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272703528] [2025-03-08 02:02:24,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:24,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-08 02:02:24,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-08 02:02:24,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:24,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 02:02:24,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:24,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272703528] [2025-03-08 02:02:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272703528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:24,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:24,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672445137] [2025-03-08 02:02:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:24,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:24,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:24,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:24,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:24,794 INFO L87 Difference]: Start difference. First operand 12064 states and 13657 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:26,126 INFO L93 Difference]: Finished difference Result 28625 states and 32702 transitions. [2025-03-08 02:02:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:26,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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 554 [2025-03-08 02:02:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:26,149 INFO L225 Difference]: With dead ends: 28625 [2025-03-08 02:02:26,149 INFO L226 Difference]: Without dead ends: 16862 [2025-03-08 02:02:26,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:26,161 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:26,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:02:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16862 states. [2025-03-08 02:02:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16862 to 15954. [2025-03-08 02:02:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15954 states, 15953 states have (on average 1.1254309534256879) internal successors, (17954), 15953 states have internal predecessors, (17954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15954 states to 15954 states and 17954 transitions. [2025-03-08 02:02:26,307 INFO L78 Accepts]: Start accepts. Automaton has 15954 states and 17954 transitions. Word has length 554 [2025-03-08 02:02:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:26,308 INFO L471 AbstractCegarLoop]: Abstraction has 15954 states and 17954 transitions. [2025-03-08 02:02:26,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15954 states and 17954 transitions. [2025-03-08 02:02:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2025-03-08 02:02:26,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:26,315 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-08 02:02:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:02:26,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:26,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash -130933830, now seen corresponding path program 1 times [2025-03-08 02:02:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408022626] [2025-03-08 02:02:26,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:26,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-03-08 02:02:26,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-03-08 02:02:26,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:26,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 624 proven. 39 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 02:02:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:26,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408022626] [2025-03-08 02:02:26,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408022626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:02:26,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320660312] [2025-03-08 02:02:26,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:26,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:02:26,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:02:26,899 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-08 02:02:26,900 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-08 02:02:26,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-03-08 02:02:27,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-03-08 02:02:27,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:27,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:27,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:02:27,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:02:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 624 proven. 39 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 02:02:27,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:02:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 624 proven. 39 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 02:02:28,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320660312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:02:28,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:02:28,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-08 02:02:28,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313950758] [2025-03-08 02:02:28,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:02:28,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:02:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:28,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:02:28,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:02:28,306 INFO L87 Difference]: Start difference. First operand 15954 states and 17954 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:32,629 INFO L93 Difference]: Finished difference Result 40238 states and 45011 transitions. [2025-03-08 02:02:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 02:02:32,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 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 621 [2025-03-08 02:02:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:32,664 INFO L225 Difference]: With dead ends: 40238 [2025-03-08 02:02:32,664 INFO L226 Difference]: Without dead ends: 17747 [2025-03-08 02:02:32,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1237 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-08 02:02:32,682 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2682 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 6697 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 6697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:32,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 314 Invalid, 7312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 6697 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 02:02:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2025-03-08 02:02:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 12661. [2025-03-08 02:02:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12661 states, 12660 states have (on average 1.068562401263823) internal successors, (13528), 12660 states have internal predecessors, (13528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 13528 transitions. [2025-03-08 02:02:32,873 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 13528 transitions. Word has length 621 [2025-03-08 02:02:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:32,874 INFO L471 AbstractCegarLoop]: Abstraction has 12661 states and 13528 transitions. [2025-03-08 02:02:32,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 13528 transitions. [2025-03-08 02:02:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-03-08 02:02:32,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:32,884 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:32,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:02:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 02:02:33,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:33,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2146871027, now seen corresponding path program 1 times [2025-03-08 02:02:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60783979] [2025-03-08 02:02:33,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:33,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-03-08 02:02:33,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-03-08 02:02:33,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:33,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2025-03-08 02:02:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60783979] [2025-03-08 02:02:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60783979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:33,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:33,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:33,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105441254] [2025-03-08 02:02:33,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:33,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:33,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:33,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:33,355 INFO L87 Difference]: Start difference. First operand 12661 states and 13528 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:33,990 INFO L93 Difference]: Finished difference Result 25318 states and 27064 transitions. [2025-03-08 02:02:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:33,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 646 [2025-03-08 02:02:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:34,003 INFO L225 Difference]: With dead ends: 25318 [2025-03-08 02:02:34,003 INFO L226 Difference]: Without dead ends: 12958 [2025-03-08 02:02:34,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:34,012 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:34,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:02:34,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12958 states. [2025-03-08 02:02:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12958 to 12659. [2025-03-08 02:02:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.0684152314741666) internal successors, (13524), 12658 states have internal predecessors, (13524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13524 transitions. [2025-03-08 02:02:34,103 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13524 transitions. Word has length 646 [2025-03-08 02:02:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:34,103 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 13524 transitions. [2025-03-08 02:02:34,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13524 transitions. [2025-03-08 02:02:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-08 02:02:34,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:34,109 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:02:34,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:02:34,109 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:34,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:34,110 INFO L85 PathProgramCache]: Analyzing trace with hash 899956565, now seen corresponding path program 1 times [2025-03-08 02:02:34,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:34,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011118963] [2025-03-08 02:02:34,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:34,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:34,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-08 02:02:34,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-08 02:02:34,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:34,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-08 02:02:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:34,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011118963] [2025-03-08 02:02:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011118963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:34,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:34,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:34,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501423087] [2025-03-08 02:02:34,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:34,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:34,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:34,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:34,701 INFO L87 Difference]: Start difference. First operand 12659 states and 13524 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:35,489 INFO L93 Difference]: Finished difference Result 25322 states and 27053 transitions. [2025-03-08 02:02:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 667 [2025-03-08 02:02:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:35,503 INFO L225 Difference]: With dead ends: 25322 [2025-03-08 02:02:35,504 INFO L226 Difference]: Without dead ends: 12665 [2025-03-08 02:02:35,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:35,515 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 309 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:35,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 138 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:02:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12665 states. [2025-03-08 02:02:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12665 to 12061. [2025-03-08 02:02:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12061 states, 12060 states have (on average 1.0548092868988392) internal successors, (12721), 12060 states have internal predecessors, (12721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12061 states to 12061 states and 12721 transitions. [2025-03-08 02:02:35,612 INFO L78 Accepts]: Start accepts. Automaton has 12061 states and 12721 transitions. Word has length 667 [2025-03-08 02:02:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:35,613 INFO L471 AbstractCegarLoop]: Abstraction has 12061 states and 12721 transitions. [2025-03-08 02:02:35,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12061 states and 12721 transitions. [2025-03-08 02:02:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-08 02:02:35,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:35,618 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:02:35,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:02:35,619 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:35,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -985983025, now seen corresponding path program 1 times [2025-03-08 02:02:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527688478] [2025-03-08 02:02:35,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:35,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-08 02:02:35,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-08 02:02:35,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:35,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 02:02:36,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:36,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527688478] [2025-03-08 02:02:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527688478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:36,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:36,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943465968] [2025-03-08 02:02:36,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:36,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:36,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:36,041 INFO L87 Difference]: Start difference. First operand 12061 states and 12721 transitions. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:36,916 INFO L93 Difference]: Finished difference Result 27707 states and 29300 transitions. [2025-03-08 02:02:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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 691 [2025-03-08 02:02:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:36,932 INFO L225 Difference]: With dead ends: 27707 [2025-03-08 02:02:36,932 INFO L226 Difference]: Without dead ends: 15648 [2025-03-08 02:02:36,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:36,942 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 86 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:36,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 513 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:02:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15648 states. [2025-03-08 02:02:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15648 to 15647. [2025-03-08 02:02:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15647 states, 15646 states have (on average 1.0487664578806084) internal successors, (16409), 15646 states have internal predecessors, (16409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15647 states to 15647 states and 16409 transitions. [2025-03-08 02:02:37,067 INFO L78 Accepts]: Start accepts. Automaton has 15647 states and 16409 transitions. Word has length 691 [2025-03-08 02:02:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:37,067 INFO L471 AbstractCegarLoop]: Abstraction has 15647 states and 16409 transitions. [2025-03-08 02:02:37,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 15647 states and 16409 transitions. [2025-03-08 02:02:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-08 02:02:37,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:37,074 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:37,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:02:37,074 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:37,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash 759235531, now seen corresponding path program 1 times [2025-03-08 02:02:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:37,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228171325] [2025-03-08 02:02:37,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:37,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-08 02:02:37,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-08 02:02:37,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:37,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 635 proven. 190 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 02:02:37,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:37,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228171325] [2025-03-08 02:02:37,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228171325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:02:37,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556454151] [2025-03-08 02:02:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:37,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:02:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:02:37,662 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-08 02:02:37,663 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-08 02:02:37,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-08 02:02:37,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-08 02:02:37,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:37,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:37,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:02:37,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:02:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-08 02:02:38,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:02:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556454151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:02:38,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 02:02:38,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50548349] [2025-03-08 02:02:38,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:38,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:38,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:38,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:02:38,160 INFO L87 Difference]: Start difference. First operand 15647 states and 16409 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:39,136 INFO L93 Difference]: Finished difference Result 35802 states and 37627 transitions. [2025-03-08 02:02:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 698 [2025-03-08 02:02:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:39,155 INFO L225 Difference]: With dead ends: 35802 [2025-03-08 02:02:39,155 INFO L226 Difference]: Without dead ends: 20157 [2025-03-08 02:02:39,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:02:39,163 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 274 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:39,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 488 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:02:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20157 states. [2025-03-08 02:02:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20157 to 19546. [2025-03-08 02:02:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19546 states, 19545 states have (on average 1.0494755691992836) internal successors, (20512), 19545 states have internal predecessors, (20512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19546 states to 19546 states and 20512 transitions. [2025-03-08 02:02:39,307 INFO L78 Accepts]: Start accepts. Automaton has 19546 states and 20512 transitions. Word has length 698 [2025-03-08 02:02:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:39,308 INFO L471 AbstractCegarLoop]: Abstraction has 19546 states and 20512 transitions. [2025-03-08 02:02:39,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 19546 states and 20512 transitions. [2025-03-08 02:02:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2025-03-08 02:02:39,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:39,322 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:02:39,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:02:39,523 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,SelfDestructingSolverStorable16 [2025-03-08 02:02:39,523 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:39,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1475631362, now seen corresponding path program 1 times [2025-03-08 02:02:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752653567] [2025-03-08 02:02:39,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:39,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 886 statements into 1 equivalence classes. [2025-03-08 02:02:39,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 886 of 886 statements. [2025-03-08 02:02:39,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:39,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 866 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-08 02:02:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752653567] [2025-03-08 02:02:40,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752653567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:40,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:40,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:40,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962328948] [2025-03-08 02:02:40,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:40,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:40,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:40,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:40,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:40,356 INFO L87 Difference]: Start difference. First operand 19546 states and 20512 transitions. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:41,183 INFO L93 Difference]: Finished difference Result 38797 states and 40729 transitions. [2025-03-08 02:02:41,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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 886 [2025-03-08 02:02:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:41,205 INFO L225 Difference]: With dead ends: 38797 [2025-03-08 02:02:41,205 INFO L226 Difference]: Without dead ends: 19552 [2025-03-08 02:02:41,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:41,218 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 129 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:41,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 116 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:02:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19552 states. [2025-03-08 02:02:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19552 to 19546. [2025-03-08 02:02:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19546 states, 19545 states have (on average 1.0459452545408032) internal successors, (20443), 19545 states have internal predecessors, (20443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19546 states to 19546 states and 20443 transitions. [2025-03-08 02:02:41,373 INFO L78 Accepts]: Start accepts. Automaton has 19546 states and 20443 transitions. Word has length 886 [2025-03-08 02:02:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:41,373 INFO L471 AbstractCegarLoop]: Abstraction has 19546 states and 20443 transitions. [2025-03-08 02:02:41,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 19546 states and 20443 transitions. [2025-03-08 02:02:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2025-03-08 02:02:41,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:41,389 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:02:41,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:02:41,389 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:41,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash -745927188, now seen corresponding path program 1 times [2025-03-08 02:02:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:41,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403817373] [2025-03-08 02:02:41,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:41,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 906 statements into 1 equivalence classes. [2025-03-08 02:02:41,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 906 of 906 statements. [2025-03-08 02:02:41,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:41,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 784 proven. 390 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-08 02:02:42,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:42,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403817373] [2025-03-08 02:02:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403817373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:02:42,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736784586] [2025-03-08 02:02:42,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:42,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:02:42,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:02:42,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:02:42,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:02:42,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 906 statements into 1 equivalence classes. [2025-03-08 02:02:42,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 906 of 906 statements. [2025-03-08 02:02:42,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:42,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:42,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:02:42,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:02:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-08 02:02:42,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:02:42,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736784586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:42,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:02:42,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 02:02:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810673182] [2025-03-08 02:02:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:42,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:42,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:42,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:42,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:02:42,965 INFO L87 Difference]: Start difference. First operand 19546 states and 20443 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:43,837 INFO L93 Difference]: Finished difference Result 42676 states and 44717 transitions. [2025-03-08 02:02:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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 906 [2025-03-08 02:02:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:43,863 INFO L225 Difference]: With dead ends: 42676 [2025-03-08 02:02:43,863 INFO L226 Difference]: Without dead ends: 23431 [2025-03-08 02:02:43,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:02:43,880 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:43,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 165 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:02:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23431 states. [2025-03-08 02:02:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23431 to 22235. [2025-03-08 02:02:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22235 states, 22234 states have (on average 1.0425474498515788) internal successors, (23180), 22234 states have internal predecessors, (23180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22235 states to 22235 states and 23180 transitions. [2025-03-08 02:02:44,110 INFO L78 Accepts]: Start accepts. Automaton has 22235 states and 23180 transitions. Word has length 906 [2025-03-08 02:02:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:44,110 INFO L471 AbstractCegarLoop]: Abstraction has 22235 states and 23180 transitions. [2025-03-08 02:02:44,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 22235 states and 23180 transitions. [2025-03-08 02:02:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2025-03-08 02:02:44,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:44,123 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:02:44,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 02:02:44,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:02:44,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:44,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1176752039, now seen corresponding path program 1 times [2025-03-08 02:02:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43259249] [2025-03-08 02:02:44,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:44,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 908 statements into 1 equivalence classes. [2025-03-08 02:02:44,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 908 of 908 statements. [2025-03-08 02:02:44,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:44,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-08 02:02:44,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:44,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43259249] [2025-03-08 02:02:44,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43259249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:44,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:44,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:44,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762656991] [2025-03-08 02:02:44,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:44,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:44,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:44,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:44,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:44,672 INFO L87 Difference]: Start difference. First operand 22235 states and 23180 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:45,679 INFO L93 Difference]: Finished difference Result 50747 states and 52924 transitions. [2025-03-08 02:02:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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 908 [2025-03-08 02:02:45,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:45,708 INFO L225 Difference]: With dead ends: 50747 [2025-03-08 02:02:45,708 INFO L226 Difference]: Without dead ends: 28813 [2025-03-08 02:02:45,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:45,723 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:45,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 139 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:02:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28813 states. [2025-03-08 02:02:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28813 to 27019. [2025-03-08 02:02:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27019 states, 27018 states have (on average 1.0381967577170774) internal successors, (28050), 27018 states have internal predecessors, (28050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27019 states to 27019 states and 28050 transitions. [2025-03-08 02:02:46,029 INFO L78 Accepts]: Start accepts. Automaton has 27019 states and 28050 transitions. Word has length 908 [2025-03-08 02:02:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:46,029 INFO L471 AbstractCegarLoop]: Abstraction has 27019 states and 28050 transitions. [2025-03-08 02:02:46,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27019 states and 28050 transitions. [2025-03-08 02:02:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2025-03-08 02:02:46,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:46,045 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:46,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:02:46,045 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:46,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash 622436568, now seen corresponding path program 1 times [2025-03-08 02:02:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:46,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314737719] [2025-03-08 02:02:46,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:46,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:46,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 964 statements into 1 equivalence classes. [2025-03-08 02:02:46,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 964 of 964 statements. [2025-03-08 02:02:46,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:46,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-03-08 02:02:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314737719] [2025-03-08 02:02:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314737719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:02:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641689880] [2025-03-08 02:02:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:02:46,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:46,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:02:46,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:46,457 INFO L87 Difference]: Start difference. First operand 27019 states and 28050 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:47,109 INFO L93 Difference]: Finished difference Result 54330 states and 56397 transitions. [2025-03-08 02:02:47,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:02:47,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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 964 [2025-03-08 02:02:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:47,136 INFO L225 Difference]: With dead ends: 54330 [2025-03-08 02:02:47,136 INFO L226 Difference]: Without dead ends: 27313 [2025-03-08 02:02:47,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:02:47,155 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 310 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:47,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 514 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:02:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27313 states. [2025-03-08 02:02:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27313 to 24321. [2025-03-08 02:02:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24321 states, 24320 states have (on average 1.0376644736842104) internal successors, (25236), 24320 states have internal predecessors, (25236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24321 states to 24321 states and 25236 transitions. [2025-03-08 02:02:47,465 INFO L78 Accepts]: Start accepts. Automaton has 24321 states and 25236 transitions. Word has length 964 [2025-03-08 02:02:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:47,466 INFO L471 AbstractCegarLoop]: Abstraction has 24321 states and 25236 transitions. [2025-03-08 02:02:47,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 24321 states and 25236 transitions. [2025-03-08 02:02:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 999 [2025-03-08 02:02:47,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:47,480 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:02:47,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:02:47,484 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:47,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1397335712, now seen corresponding path program 1 times [2025-03-08 02:02:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652940584] [2025-03-08 02:02:47,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:47,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 998 statements into 1 equivalence classes. [2025-03-08 02:02:47,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 998 of 998 statements. [2025-03-08 02:02:47,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:47,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 916 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-08 02:02:48,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:48,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652940584] [2025-03-08 02:02:48,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652940584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:02:48,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:02:48,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:02:48,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220253178] [2025-03-08 02:02:48,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:02:48,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:02:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:48,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:02:48,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:02:48,355 INFO L87 Difference]: Start difference. First operand 24321 states and 25236 transitions. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:49,619 INFO L93 Difference]: Finished difference Result 56738 states and 58877 transitions. [2025-03-08 02:02:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:02:49,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 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 998 [2025-03-08 02:02:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:49,659 INFO L225 Difference]: With dead ends: 56738 [2025-03-08 02:02:49,659 INFO L226 Difference]: Without dead ends: 32718 [2025-03-08 02:02:49,677 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-08 02:02:49,681 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 360 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:49,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 139 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:02:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32718 states. [2025-03-08 02:02:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32718 to 25523. [2025-03-08 02:02:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25523 states, 25522 states have (on average 1.039260246062221) internal successors, (26524), 25522 states have internal predecessors, (26524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25523 states to 25523 states and 26524 transitions. [2025-03-08 02:02:50,014 INFO L78 Accepts]: Start accepts. Automaton has 25523 states and 26524 transitions. Word has length 998 [2025-03-08 02:02:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:50,015 INFO L471 AbstractCegarLoop]: Abstraction has 25523 states and 26524 transitions. [2025-03-08 02:02:50,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25523 states and 26524 transitions. [2025-03-08 02:02:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2025-03-08 02:02:50,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:50,034 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:02:50,035 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 968188068, now seen corresponding path program 1 times [2025-03-08 02:02:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093495345] [2025-03-08 02:02:50,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:50,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1043 statements into 1 equivalence classes. [2025-03-08 02:02:50,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1043 of 1043 statements. [2025-03-08 02:02:50,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:50,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 255 proven. 706 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-08 02:02:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:02:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093495345] [2025-03-08 02:02:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093495345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:02:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693582447] [2025-03-08 02:02:50,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:02:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:02:50,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:02:50,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:02:50,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1043 statements into 1 equivalence classes. [2025-03-08 02:02:51,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1043 of 1043 statements. [2025-03-08 02:02:51,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:51,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:02:51,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:02:51,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:02:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 255 proven. 706 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-08 02:02:55,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:02:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 255 proven. 706 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-08 02:02:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693582447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:02:55,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:02:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-08 02:02:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614005257] [2025-03-08 02:02:55,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:02:55,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:02:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:02:55,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:02:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:02:55,917 INFO L87 Difference]: Start difference. First operand 25523 states and 26524 transitions. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 9 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:02:59,006 INFO L93 Difference]: Finished difference Result 69044 states and 71741 transitions. [2025-03-08 02:02:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 02:02:59,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 9 states have internal predecessors, (1546), 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 1043 [2025-03-08 02:02:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:02:59,049 INFO L225 Difference]: With dead ends: 69044 [2025-03-08 02:02:59,049 INFO L226 Difference]: Without dead ends: 43822 [2025-03-08 02:02:59,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2088 GetRequests, 2080 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:02:59,069 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 1091 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3865 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 3865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:02:59,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 262 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 3865 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 02:02:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43822 states. [2025-03-08 02:02:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43822 to 24022. [2025-03-08 02:02:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24022 states, 24021 states have (on average 1.0373839557054245) internal successors, (24919), 24021 states have internal predecessors, (24919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24022 states to 24022 states and 24919 transitions. [2025-03-08 02:02:59,316 INFO L78 Accepts]: Start accepts. Automaton has 24022 states and 24919 transitions. Word has length 1043 [2025-03-08 02:02:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:02:59,316 INFO L471 AbstractCegarLoop]: Abstraction has 24022 states and 24919 transitions. [2025-03-08 02:02:59,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 9 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:02:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24022 states and 24919 transitions. [2025-03-08 02:02:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1408 [2025-03-08 02:02:59,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:02:59,332 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:02:59,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:02:59,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:02:59,533 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:02:59,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:02:59,534 INFO L85 PathProgramCache]: Analyzing trace with hash 221892460, now seen corresponding path program 1 times [2025-03-08 02:02:59,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:02:59,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206300453] [2025-03-08 02:02:59,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:02:59,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:02:59,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1407 statements into 1 equivalence classes. [2025-03-08 02:02:59,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1407 of 1407 statements. [2025-03-08 02:02:59,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:02:59,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3977 backedges. 2686 proven. 0 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2025-03-08 02:03:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206300453] [2025-03-08 02:03:01,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206300453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:01,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:01,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:01,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376536133] [2025-03-08 02:03:01,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:01,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:01,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:01,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:01,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:01,440 INFO L87 Difference]: Start difference. First operand 24022 states and 24919 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:02,253 INFO L93 Difference]: Finished difference Result 36926 states and 38235 transitions. [2025-03-08 02:03:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:02,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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 1407 [2025-03-08 02:03:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:02,255 INFO L225 Difference]: With dead ends: 36926 [2025-03-08 02:03:02,255 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:03:02,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:02,268 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 154 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:02,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 63 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:03:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:03:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:03:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:03:02,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1407 [2025-03-08 02:03:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:02,269 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:03:02,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:03:02,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:03:02,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:03:02,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 02:03:02,275 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-08 02:03:02,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:03:05,873 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:03:05,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:03:05 BoogieIcfgContainer [2025-03-08 02:03:05,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:03:05,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:03:05,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:03:05,894 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:03:05,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:02:05" (3/4) ... [2025-03-08 02:03:05,901 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:03:05,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 02:03:05,926 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 02:03:05,928 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 02:03:05,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 02:03:06,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:03:06,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:03:06,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:03:06,090 INFO L158 Benchmark]: Toolchain (without parser) took 63890.23ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 117.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 650.0MB. Max. memory is 16.1GB. [2025-03-08 02:03:06,090 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:03:06,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.41ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 43.8MB in the end (delta: 73.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 02:03:06,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 164.66ms. Allocated memory is still 167.8MB. Free memory was 43.8MB in the beginning and 85.0MB in the end (delta: -41.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-03-08 02:03:06,091 INFO L158 Benchmark]: Boogie Preprocessor took 221.19ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 94.8MB in the end (delta: -9.8MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2025-03-08 02:03:06,091 INFO L158 Benchmark]: IcfgBuilder took 2215.46ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 94.8MB in the beginning and 142.1MB in the end (delta: -47.3MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2025-03-08 02:03:06,091 INFO L158 Benchmark]: TraceAbstraction took 60383.89ms. Allocated memory was 419.4MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 141.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-08 02:03:06,092 INFO L158 Benchmark]: Witness Printer took 195.95ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 02:03:06,093 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.16ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.41ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 43.8MB in the end (delta: 73.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 164.66ms. Allocated memory is still 167.8MB. Free memory was 43.8MB in the beginning and 85.0MB in the end (delta: -41.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 221.19ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 94.8MB in the end (delta: -9.8MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2215.46ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 94.8MB in the beginning and 142.1MB in the end (delta: -47.3MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. * TraceAbstraction took 60383.89ms. Allocated memory was 419.4MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 141.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 195.95ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 215]: 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, 424 locations, 749 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.7s, OverallIterations: 24, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 32.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9869 SdHoareTripleChecker+Valid, 29.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9869 mSDsluCounter, 8294 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1224 mSDsCounter, 4812 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31555 IncrementalHoareTripleChecker+Invalid, 36367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4812 mSolverCounterUnsat, 7070 mSDtfsCounter, 31555 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5020 GetRequests, 4967 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27019occurred in iteration=20, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 44136 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 17543 NumberOfCodeBlocks, 17543 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 19177 ConstructedInterpolants, 332 QuantifiedInterpolants, 66566 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3850 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 24287/27102 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: 1776]: Location Invariant Derived location invariant: (((((((((((((((((((0 <= ((long long) a29 + 14)) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) || (((2 == a2) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || ((2 != a2) && (((long long) 89 + a4) <= 0))) || ((((long long) 89 + a4) <= 0) && (((long long) a29 + 401505) <= 0))) || (((((0 <= ((long long) a29 + 14)) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) 600177 + a0))) && (a2 == 4))) || ((0 <= ((long long) a29 + 14)) && (((long long) 89 + a4) <= 0))) || (((((((long long) 42 + a4) <= 0) && (2 != a2)) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) 600177 + a0))) && (a2 != 4))) || ((((0 <= ((long long) a0 + 459337)) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 99) <= 0)) && (a2 == 4))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 99) <= 0)) && (3 == a2))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60)))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0))) || (((((((0 <= ((long long) a29 + 14)) && (3 != a2)) && (((long long) 42 + a4) <= 0)) && (2 != a2)) && (a2 != 4)) && (0 <= (((((long long) 9 * a0) >= 0) ? (((long long) 9 * a0) / 10) : ((((long long) 9 * a0) / 10) - 1)) + 4794))) && (((long long) a0 + 61) <= 0))) || (((((a2 == 1) && (((long long) a0 + 61) <= 0)) || (((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (a29 <= 401234))) && (((long long) 42 + a4) <= 0)) && (0 <= (((((long long) 9 * a0) >= 0) ? (((long long) 9 * a0) / 10) : ((((long long) 9 * a0) / 10) - 1)) + 4794)))) || ((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 02:03:06,115 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