./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label19.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/Problem13_label19.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 a964c9c76c4af918501d56362d39292d13dbbfa4832d6b5721a3773b73fa584b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:51:43,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:51:43,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:51:43,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:51:43,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:51:43,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:51:43,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:51:43,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:51:43,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:51:43,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:51:43,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:51:43,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:51:43,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:51:43,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:51:43,505 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:51:43,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:51:43,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:51:43,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:51:43,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:51:43,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:51:43,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:51:43,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:51:43,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:51:43,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:51:43,506 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 -> a964c9c76c4af918501d56362d39292d13dbbfa4832d6b5721a3773b73fa584b [2025-03-08 01:51:43,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:51:43,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:51:43,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:51:43,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:51:43,769 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:51:43,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label19.c [2025-03-08 01:51:44,957 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9027496/b87021ee74f64725bd5a83913235fb7f/FLAGd5f4ce007 [2025-03-08 01:51:45,362 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:51:45,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label19.c [2025-03-08 01:51:45,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9027496/b87021ee74f64725bd5a83913235fb7f/FLAGd5f4ce007 [2025-03-08 01:51:45,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9027496/b87021ee74f64725bd5a83913235fb7f [2025-03-08 01:51:45,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:51:45,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:51:45,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:51:45,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:51:45,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:51:45,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:51:45" (1/1) ... [2025-03-08 01:51:45,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38784a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:45, skipping insertion in model container [2025-03-08 01:51:45,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:51:45" (1/1) ... [2025-03-08 01:51:45,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:51:45,780 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/Problem13_label19.c[2731,2744] [2025-03-08 01:51:46,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:51:46,283 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:51:46,292 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/Problem13_label19.c[2731,2744] [2025-03-08 01:51:46,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:51:46,624 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:51:46,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46 WrapperNode [2025-03-08 01:51:46,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:51:46,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:51:46,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:51:46,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:51:46,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:46,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,010 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:51:47,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:51:47,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:51:47,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:51:47,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:51:47,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,328 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 01:51:47,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:51:47,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:51:47,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:51:47,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:51:47,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (1/1) ... [2025-03-08 01:51:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:51:47,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:51:47,752 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 01:51:47,754 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 01:51:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:51:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:51:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:51:47,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:51:47,817 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:51:47,818 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:51:52,029 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:51:52,030 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:51:52,030 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:51:52,192 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:51:52,193 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:51:52,229 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:51:52,230 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:51:52,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:52 BoogieIcfgContainer [2025-03-08 01:51:52,230 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:51:52,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:51:52,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:51:52,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:51:52,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:51:45" (1/3) ... [2025-03-08 01:51:52,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8243ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:51:52, skipping insertion in model container [2025-03-08 01:51:52,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:46" (2/3) ... [2025-03-08 01:51:52,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8243ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:51:52, skipping insertion in model container [2025-03-08 01:51:52,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:52" (3/3) ... [2025-03-08 01:51:52,239 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label19.c [2025-03-08 01:51:52,251 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:51:52,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label19.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:51:52,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:51:52,336 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;@5b569525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:51:52,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:51:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 01:51:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 01:51:52,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:52,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:52,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:52,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash -646602758, now seen corresponding path program 1 times [2025-03-08 01:51:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:52,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342435014] [2025-03-08 01:51:52,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:52,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 01:51:52,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 01:51:52,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:52,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:52,560 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 01:51:52,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:52,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342435014] [2025-03-08 01:51:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342435014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:52,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:51:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311396315] [2025-03-08 01:51:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:52,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:52,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:52,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:52,584 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 01:51:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:56,023 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-03-08 01:51:56,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:56,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-08 01:51:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:56,041 INFO L225 Difference]: With dead ends: 3082 [2025-03-08 01:51:56,042 INFO L226 Difference]: Without dead ends: 1899 [2025-03-08 01:51:56,049 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 01:51:56,054 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1022 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:56,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 646 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 01:51:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-03-08 01:51:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-03-08 01:51:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 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 01:51:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-03-08 01:51:56,160 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 17 [2025-03-08 01:51:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:56,160 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-03-08 01:51:56,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 01:51:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-03-08 01:51:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 01:51:56,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:56,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:56,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:51:56,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:56,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1390386658, now seen corresponding path program 1 times [2025-03-08 01:51:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:56,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014391551] [2025-03-08 01:51:56,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:56,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 01:51:56,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 01:51:56,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:56,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:51:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:56,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014391551] [2025-03-08 01:51:56,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014391551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:56,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:56,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:51:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658812563] [2025-03-08 01:51:56,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:56,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:56,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:56,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:56,540 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 01:51:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:59,832 INFO L93 Difference]: Finished difference Result 5437 states and 9566 transitions. [2025-03-08 01:51:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-08 01:51:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:59,844 INFO L225 Difference]: With dead ends: 5437 [2025-03-08 01:51:59,844 INFO L226 Difference]: Without dead ends: 3545 [2025-03-08 01:51:59,846 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 01:51:59,847 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:59,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 881 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 01:51:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2025-03-08 01:51:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3484. [2025-03-08 01:51:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 1.5865633074935401) internal successors, (5526), 3483 states have internal predecessors, (5526), 0 states have call successors, (0), 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 01:51:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5526 transitions. [2025-03-08 01:51:59,902 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5526 transitions. Word has length 82 [2025-03-08 01:51:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:59,903 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 5526 transitions. [2025-03-08 01:51:59,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 01:51:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5526 transitions. [2025-03-08 01:51:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 01:51:59,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:59,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:59,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:51:59,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:59,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash -527470094, now seen corresponding path program 1 times [2025-03-08 01:51:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:59,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138028368] [2025-03-08 01:51:59,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:59,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 01:51:59,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 01:51:59,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:52:00,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:00,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138028368] [2025-03-08 01:52:00,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138028368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:00,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:00,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:52:00,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553778440] [2025-03-08 01:52:00,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:00,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:00,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:00,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:00,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:00,058 INFO L87 Difference]: Start difference. First operand 3484 states and 5526 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 01:52:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:02,696 INFO L93 Difference]: Finished difference Result 10138 states and 16134 transitions. [2025-03-08 01:52:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-08 01:52:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:02,716 INFO L225 Difference]: With dead ends: 10138 [2025-03-08 01:52:02,716 INFO L226 Difference]: Without dead ends: 6656 [2025-03-08 01:52:02,722 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 01:52:02,722 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:02,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1136 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:52:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2025-03-08 01:52:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6655. [2025-03-08 01:52:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4171926660655245) internal successors, (9430), 6654 states have internal predecessors, (9430), 0 states have call successors, (0), 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 01:52:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9430 transitions. [2025-03-08 01:52:02,811 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9430 transitions. Word has length 83 [2025-03-08 01:52:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:02,812 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9430 transitions. [2025-03-08 01:52:02,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 01:52:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9430 transitions. [2025-03-08 01:52:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 01:52:02,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:02,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:02,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:52:02,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:02,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1238294828, now seen corresponding path program 1 times [2025-03-08 01:52:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:02,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663413376] [2025-03-08 01:52:02,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:02,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 01:52:02,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 01:52:02,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:52:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:02,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663413376] [2025-03-08 01:52:02,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663413376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:02,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:02,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:52:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627783502] [2025-03-08 01:52:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:02,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:02,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:02,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:02,924 INFO L87 Difference]: Start difference. First operand 6655 states and 9430 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 01:52:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:05,813 INFO L93 Difference]: Finished difference Result 14120 states and 20673 transitions. [2025-03-08 01:52:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:05,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-08 01:52:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:05,830 INFO L225 Difference]: With dead ends: 14120 [2025-03-08 01:52:05,830 INFO L226 Difference]: Without dead ends: 7467 [2025-03-08 01:52:05,837 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 01:52:05,838 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:05,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1176 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:52:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2025-03-08 01:52:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7456. [2025-03-08 01:52:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3389671361502347) internal successors, (9982), 7455 states have internal predecessors, (9982), 0 states have call successors, (0), 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 01:52:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9982 transitions. [2025-03-08 01:52:05,966 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9982 transitions. Word has length 86 [2025-03-08 01:52:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:05,966 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9982 transitions. [2025-03-08 01:52:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 01:52:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9982 transitions. [2025-03-08 01:52:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 01:52:05,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:05,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:05,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:52:05,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:05,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash 296266845, now seen corresponding path program 1 times [2025-03-08 01:52:05,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:05,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850355382] [2025-03-08 01:52:05,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:05,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:05,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 01:52:05,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 01:52:05,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:05,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:52:06,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:06,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850355382] [2025-03-08 01:52:06,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850355382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:06,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:06,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854154769] [2025-03-08 01:52:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:06,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:06,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:06,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:06,070 INFO L87 Difference]: Start difference. First operand 7456 states and 9982 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 01:52:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:08,873 INFO L93 Difference]: Finished difference Result 20416 states and 27818 transitions. [2025-03-08 01:52:08,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-08 01:52:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:08,906 INFO L225 Difference]: With dead ends: 20416 [2025-03-08 01:52:08,906 INFO L226 Difference]: Without dead ends: 13749 [2025-03-08 01:52:08,912 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 01:52:08,913 INFO L435 NwaCegarLoop]: 1867 mSDtfsCounter, 917 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:08,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2007 Invalid, 3292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:52:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13749 states. [2025-03-08 01:52:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13749 to 13744. [2025-03-08 01:52:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13744 states, 13743 states have (on average 1.2587499090446046) internal successors, (17299), 13743 states have internal predecessors, (17299), 0 states have call successors, (0), 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 01:52:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13744 states to 13744 states and 17299 transitions. [2025-03-08 01:52:09,088 INFO L78 Accepts]: Start accepts. Automaton has 13744 states and 17299 transitions. Word has length 128 [2025-03-08 01:52:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:09,090 INFO L471 AbstractCegarLoop]: Abstraction has 13744 states and 17299 transitions. [2025-03-08 01:52:09,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 01:52:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13744 states and 17299 transitions. [2025-03-08 01:52:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 01:52:09,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:09,094 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:09,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:52:09,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:09,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash 117582889, now seen corresponding path program 1 times [2025-03-08 01:52:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:09,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215488300] [2025-03-08 01:52:09,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:09,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 01:52:09,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 01:52:09,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:09,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 01:52:09,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215488300] [2025-03-08 01:52:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215488300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:09,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:52:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36373504] [2025-03-08 01:52:09,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:09,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:09,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:09,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:09,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:09,204 INFO L87 Difference]: Start difference. First operand 13744 states and 17299 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:12,318 INFO L93 Difference]: Finished difference Result 36950 states and 47247 transitions. [2025-03-08 01:52:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-03-08 01:52:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:12,358 INFO L225 Difference]: With dead ends: 36950 [2025-03-08 01:52:12,358 INFO L226 Difference]: Without dead ends: 23995 [2025-03-08 01:52:12,372 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 01:52:12,373 INFO L435 NwaCegarLoop]: 1026 mSDtfsCounter, 797 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:12,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1171 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 01:52:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23995 states. [2025-03-08 01:52:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23995 to 23191. [2025-03-08 01:52:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23191 states, 23190 states have (on average 1.1881414402759811) internal successors, (27553), 23190 states have internal predecessors, (27553), 0 states have call successors, (0), 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 01:52:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23191 states to 23191 states and 27553 transitions. [2025-03-08 01:52:12,667 INFO L78 Accepts]: Start accepts. Automaton has 23191 states and 27553 transitions. Word has length 157 [2025-03-08 01:52:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:12,667 INFO L471 AbstractCegarLoop]: Abstraction has 23191 states and 27553 transitions. [2025-03-08 01:52:12,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 23191 states and 27553 transitions. [2025-03-08 01:52:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 01:52:12,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:12,672 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:12,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:52:12,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:12,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1509026773, now seen corresponding path program 1 times [2025-03-08 01:52:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:12,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792500386] [2025-03-08 01:52:12,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:12,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 01:52:12,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 01:52:12,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:12,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 01:52:13,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:13,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792500386] [2025-03-08 01:52:13,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792500386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:13,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:13,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:52:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349335064] [2025-03-08 01:52:13,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:13,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:13,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:13,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:13,012 INFO L87 Difference]: Start difference. First operand 23191 states and 27553 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 01:52:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:15,452 INFO L93 Difference]: Finished difference Result 45593 states and 54307 transitions. [2025-03-08 01:52:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:15,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 222 [2025-03-08 01:52:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:15,491 INFO L225 Difference]: With dead ends: 45593 [2025-03-08 01:52:15,491 INFO L226 Difference]: Without dead ends: 23191 [2025-03-08 01:52:15,508 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 01:52:15,509 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:15,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1196 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:52:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23191 states. [2025-03-08 01:52:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23191 to 23191. [2025-03-08 01:52:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23191 states, 23190 states have (on average 1.1879258300991806) internal successors, (27548), 23190 states have internal predecessors, (27548), 0 states have call successors, (0), 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 01:52:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23191 states to 23191 states and 27548 transitions. [2025-03-08 01:52:15,842 INFO L78 Accepts]: Start accepts. Automaton has 23191 states and 27548 transitions. Word has length 222 [2025-03-08 01:52:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 23191 states and 27548 transitions. [2025-03-08 01:52:15,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 01:52:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 23191 states and 27548 transitions. [2025-03-08 01:52:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 01:52:15,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:15,852 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 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 01:52:15,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:52:15,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:15,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2049527671, now seen corresponding path program 1 times [2025-03-08 01:52:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:15,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108969198] [2025-03-08 01:52:15,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:15,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 01:52:15,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 01:52:15,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:15,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:52:16,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108969198] [2025-03-08 01:52:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108969198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:16,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:16,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743683081] [2025-03-08 01:52:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:16,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:16,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:16,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:16,223 INFO L87 Difference]: Start difference. First operand 23191 states and 27548 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 01:52:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:18,978 INFO L93 Difference]: Finished difference Result 56636 states and 68619 transitions. [2025-03-08 01:52:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:18,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-03-08 01:52:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:19,015 INFO L225 Difference]: With dead ends: 56636 [2025-03-08 01:52:19,015 INFO L226 Difference]: Without dead ends: 32656 [2025-03-08 01:52:19,027 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 01:52:19,029 INFO L435 NwaCegarLoop]: 1756 mSDtfsCounter, 767 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:19,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1897 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:52:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32656 states. [2025-03-08 01:52:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32656 to 31844. [2025-03-08 01:52:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31844 states, 31843 states have (on average 1.1619508212165939) internal successors, (37000), 31843 states have internal predecessors, (37000), 0 states have call successors, (0), 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 01:52:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31844 states to 31844 states and 37000 transitions. [2025-03-08 01:52:19,319 INFO L78 Accepts]: Start accepts. Automaton has 31844 states and 37000 transitions. Word has length 229 [2025-03-08 01:52:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:19,320 INFO L471 AbstractCegarLoop]: Abstraction has 31844 states and 37000 transitions. [2025-03-08 01:52:19,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 01:52:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 31844 states and 37000 transitions. [2025-03-08 01:52:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 01:52:19,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:19,324 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:19,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:52:19,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:19,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:19,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1588376543, now seen corresponding path program 1 times [2025-03-08 01:52:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:19,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717510928] [2025-03-08 01:52:19,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:19,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 01:52:19,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 01:52:19,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:19,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 01:52:19,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:19,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717510928] [2025-03-08 01:52:19,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717510928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:19,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:19,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125498496] [2025-03-08 01:52:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:19,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:19,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:19,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:19,751 INFO L87 Difference]: Start difference. First operand 31844 states and 37000 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 01:52:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:22,837 INFO L93 Difference]: Finished difference Result 74712 states and 88435 transitions. [2025-03-08 01:52:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:22,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 308 [2025-03-08 01:52:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:22,887 INFO L225 Difference]: With dead ends: 74712 [2025-03-08 01:52:22,888 INFO L226 Difference]: Without dead ends: 43657 [2025-03-08 01:52:22,904 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 01:52:22,904 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 847 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:22,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1947 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:52:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43657 states. [2025-03-08 01:52:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43657 to 42866. [2025-03-08 01:52:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42866 states, 42865 states have (on average 1.140930829347953) internal successors, (48906), 42865 states have internal predecessors, (48906), 0 states have call successors, (0), 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 01:52:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42866 states to 42866 states and 48906 transitions. [2025-03-08 01:52:23,260 INFO L78 Accepts]: Start accepts. Automaton has 42866 states and 48906 transitions. Word has length 308 [2025-03-08 01:52:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 42866 states and 48906 transitions. [2025-03-08 01:52:23,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 01:52:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42866 states and 48906 transitions. [2025-03-08 01:52:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-08 01:52:23,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:23,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:23,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:52:23,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:23,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 848113924, now seen corresponding path program 1 times [2025-03-08 01:52:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:23,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777328308] [2025-03-08 01:52:23,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:23,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-08 01:52:23,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-08 01:52:23,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:23,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 158 proven. 113 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 01:52:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777328308] [2025-03-08 01:52:24,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777328308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:52:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083303760] [2025-03-08 01:52:24,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:24,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:52:24,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:52:24,471 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 01:52:24,473 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 01:52:24,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-08 01:52:24,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-08 01:52:24,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:24,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:24,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:52:24,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:52:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 01:52:24,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:52:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083303760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:24,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:52:24,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 01:52:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291607836] [2025-03-08 01:52:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:24,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:24,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:24,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:24,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:24,689 INFO L87 Difference]: Start difference. First operand 42866 states and 48906 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:27,106 INFO L93 Difference]: Finished difference Result 84934 states and 97010 transitions. [2025-03-08 01:52:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2025-03-08 01:52:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:27,155 INFO L225 Difference]: With dead ends: 84934 [2025-03-08 01:52:27,155 INFO L226 Difference]: Without dead ends: 42857 [2025-03-08 01:52:27,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:27,180 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 1076 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:27,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 803 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 01:52:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42857 states. [2025-03-08 01:52:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42857 to 42856. [2025-03-08 01:52:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42856 states, 42855 states have (on average 1.1047252362618132) internal successors, (47343), 42855 states have internal predecessors, (47343), 0 states have call successors, (0), 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 01:52:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42856 states to 42856 states and 47343 transitions. [2025-03-08 01:52:27,692 INFO L78 Accepts]: Start accepts. Automaton has 42856 states and 47343 transitions. Word has length 323 [2025-03-08 01:52:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:27,692 INFO L471 AbstractCegarLoop]: Abstraction has 42856 states and 47343 transitions. [2025-03-08 01:52:27,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42856 states and 47343 transitions. [2025-03-08 01:52:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 01:52:27,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:27,695 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 01:52:27,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 01:52:27,896 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,SelfDestructingSolverStorable9 [2025-03-08 01:52:27,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:27,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:27,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1763950599, now seen corresponding path program 1 times [2025-03-08 01:52:27,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:27,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851270959] [2025-03-08 01:52:27,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:27,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:27,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 01:52:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 01:52:27,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:27,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-08 01:52:28,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:28,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851270959] [2025-03-08 01:52:28,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851270959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:28,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:28,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133348363] [2025-03-08 01:52:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:28,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:28,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:28,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:28,194 INFO L87 Difference]: Start difference. First operand 42856 states and 47343 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 01:52:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:30,940 INFO L93 Difference]: Finished difference Result 84921 states and 93891 transitions. [2025-03-08 01:52:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:30,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 342 [2025-03-08 01:52:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:30,993 INFO L225 Difference]: With dead ends: 84921 [2025-03-08 01:52:30,993 INFO L226 Difference]: Without dead ends: 42854 [2025-03-08 01:52:31,024 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 01:52:31,025 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1185 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:31,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 1420 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:52:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42854 states. [2025-03-08 01:52:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42854 to 42853. [2025-03-08 01:52:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42853 states, 42852 states have (on average 1.0797162326145804) internal successors, (46268), 42852 states have internal predecessors, (46268), 0 states have call successors, (0), 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 01:52:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42853 states to 42853 states and 46268 transitions. [2025-03-08 01:52:31,419 INFO L78 Accepts]: Start accepts. Automaton has 42853 states and 46268 transitions. Word has length 342 [2025-03-08 01:52:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:31,420 INFO L471 AbstractCegarLoop]: Abstraction has 42853 states and 46268 transitions. [2025-03-08 01:52:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 01:52:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 42853 states and 46268 transitions. [2025-03-08 01:52:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 01:52:31,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:31,424 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 01:52:31,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:52:31,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:31,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:31,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1079556677, now seen corresponding path program 1 times [2025-03-08 01:52:31,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369378177] [2025-03-08 01:52:31,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:31,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 01:52:31,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 01:52:31,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:31,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 01:52:31,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:31,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369378177] [2025-03-08 01:52:31,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369378177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:31,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:31,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839543162] [2025-03-08 01:52:31,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:31,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:52:31,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:31,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:52:31,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:52:31,648 INFO L87 Difference]: Start difference. First operand 42853 states and 46268 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 01:52:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:36,687 INFO L93 Difference]: Finished difference Result 147301 states and 159296 transitions. [2025-03-08 01:52:36,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:52:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 365 [2025-03-08 01:52:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:36,818 INFO L225 Difference]: With dead ends: 147301 [2025-03-08 01:52:36,819 INFO L226 Difference]: Without dead ends: 105237 [2025-03-08 01:52:36,851 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 01:52:36,852 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1701 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 6592 mSolverCounterSat, 1029 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 7621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1029 IncrementalHoareTripleChecker+Valid, 6592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:36,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 789 Invalid, 7621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1029 Valid, 6592 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 01:52:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105237 states. [2025-03-08 01:52:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105237 to 102743. [2025-03-08 01:52:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102743 states, 102742 states have (on average 1.0723559985205662) internal successors, (110176), 102742 states have internal predecessors, (110176), 0 states have call successors, (0), 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 01:52:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102743 states to 102743 states and 110176 transitions. [2025-03-08 01:52:37,883 INFO L78 Accepts]: Start accepts. Automaton has 102743 states and 110176 transitions. Word has length 365 [2025-03-08 01:52:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:37,884 INFO L471 AbstractCegarLoop]: Abstraction has 102743 states and 110176 transitions. [2025-03-08 01:52:37,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 01:52:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 102743 states and 110176 transitions. [2025-03-08 01:52:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-08 01:52:37,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:37,889 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:37,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:52:37,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:37,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2000856000, now seen corresponding path program 1 times [2025-03-08 01:52:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:37,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306927687] [2025-03-08 01:52:37,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:37,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 01:52:37,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 01:52:37,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:37,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 327 proven. 113 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 01:52:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306927687] [2025-03-08 01:52:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306927687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:52:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988744027] [2025-03-08 01:52:38,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:38,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:52:38,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:52:38,884 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 01:52:38,887 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 01:52:38,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 01:52:39,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 01:52:39,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:39,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:39,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:52:39,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:52:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2025-03-08 01:52:39,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:52:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988744027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:39,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:52:39,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 01:52:39,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130198978] [2025-03-08 01:52:39,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:39,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:39,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:39,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:39,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:39,045 INFO L87 Difference]: Start difference. First operand 102743 states and 110176 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 01:52:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:42,193 INFO L93 Difference]: Finished difference Result 206272 states and 221145 transitions. [2025-03-08 01:52:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:42,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 408 [2025-03-08 01:52:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:42,321 INFO L225 Difference]: With dead ends: 206272 [2025-03-08 01:52:42,322 INFO L226 Difference]: Without dead ends: 104318 [2025-03-08 01:52:42,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:42,378 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 1022 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:42,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 1467 Invalid, 3082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:52:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104318 states. [2025-03-08 01:52:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104318 to 102730. [2025-03-08 01:52:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102730 states, 102729 states have (on average 1.0600609370284924) internal successors, (108899), 102729 states have internal predecessors, (108899), 0 states have call successors, (0), 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 01:52:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102730 states to 102730 states and 108899 transitions. [2025-03-08 01:52:43,519 INFO L78 Accepts]: Start accepts. Automaton has 102730 states and 108899 transitions. Word has length 408 [2025-03-08 01:52:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:43,520 INFO L471 AbstractCegarLoop]: Abstraction has 102730 states and 108899 transitions. [2025-03-08 01:52:43,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 01:52:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 102730 states and 108899 transitions. [2025-03-08 01:52:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 01:52:43,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:43,527 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 01:52:43,533 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 01:52:43,727 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,SelfDestructingSolverStorable12 [2025-03-08 01:52:43,728 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:43,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash -25472320, now seen corresponding path program 1 times [2025-03-08 01:52:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045418242] [2025-03-08 01:52:43,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:43,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 01:52:43,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 01:52:43,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:43,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-08 01:52:44,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045418242] [2025-03-08 01:52:44,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045418242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:44,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:44,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020909152] [2025-03-08 01:52:44,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:44,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:44,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:44,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:44,106 INFO L87 Difference]: Start difference. First operand 102730 states and 108899 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 01:52:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:48,272 INFO L93 Difference]: Finished difference Result 262267 states and 278617 transitions. [2025-03-08 01:52:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 448 [2025-03-08 01:52:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:48,457 INFO L225 Difference]: With dead ends: 262267 [2025-03-08 01:52:48,457 INFO L226 Difference]: Without dead ends: 160326 [2025-03-08 01:52:48,537 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 01:52:48,538 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 843 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2976 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 3580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 2976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:48,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 773 Invalid, 3580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 2976 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-08 01:52:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160326 states. [2025-03-08 01:52:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160326 to 157065. [2025-03-08 01:52:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157065 states, 157064 states have (on average 1.0576771252483064) internal successors, (166123), 157064 states have internal predecessors, (166123), 0 states have call successors, (0), 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 01:52:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157065 states to 157065 states and 166123 transitions. [2025-03-08 01:52:50,075 INFO L78 Accepts]: Start accepts. Automaton has 157065 states and 166123 transitions. Word has length 448 [2025-03-08 01:52:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:50,075 INFO L471 AbstractCegarLoop]: Abstraction has 157065 states and 166123 transitions. [2025-03-08 01:52:50,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 01:52:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 157065 states and 166123 transitions. [2025-03-08 01:52:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-08 01:52:50,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:50,081 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:52:50,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:52:50,081 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:50,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1635974803, now seen corresponding path program 1 times [2025-03-08 01:52:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:50,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504087884] [2025-03-08 01:52:50,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:50,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-08 01:52:50,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-08 01:52:50,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:50,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-08 01:52:50,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:50,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504087884] [2025-03-08 01:52:50,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504087884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:50,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:50,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629596297] [2025-03-08 01:52:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:50,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:50,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:50,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:50,584 INFO L87 Difference]: Start difference. First operand 157065 states and 166123 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) 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 01:52:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:54,133 INFO L93 Difference]: Finished difference Result 346400 states and 367912 transitions. [2025-03-08 01:52:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:54,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) 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 457 [2025-03-08 01:52:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:54,353 INFO L225 Difference]: With dead ends: 346400 [2025-03-08 01:52:54,353 INFO L226 Difference]: Without dead ends: 191698 [2025-03-08 01:52:54,419 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 01:52:54,420 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 912 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:54,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 744 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:52:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191698 states. [2025-03-08 01:52:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191698 to 190105. [2025-03-08 01:52:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190105 states, 190104 states have (on average 1.056448049488701) internal successors, (200835), 190104 states have internal predecessors, (200835), 0 states have call successors, (0), 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 01:52:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190105 states to 190105 states and 200835 transitions. [2025-03-08 01:52:56,848 INFO L78 Accepts]: Start accepts. Automaton has 190105 states and 200835 transitions. Word has length 457 [2025-03-08 01:52:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:56,848 INFO L471 AbstractCegarLoop]: Abstraction has 190105 states and 200835 transitions. [2025-03-08 01:52:56,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) 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 01:52:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 190105 states and 200835 transitions. [2025-03-08 01:52:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-08 01:52:56,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:56,856 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:56,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:52:56,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:56,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1368633214, now seen corresponding path program 1 times [2025-03-08 01:52:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317178937] [2025-03-08 01:52:56,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:56,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-08 01:52:56,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-08 01:52:56,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:56,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 482 proven. 113 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 01:52:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317178937] [2025-03-08 01:52:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317178937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:52:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126603951] [2025-03-08 01:52:57,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:57,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:52:57,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:52:57,943 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 01:52:57,944 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 01:52:58,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-08 01:52:58,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-08 01:52:58,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:58,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:52:58,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:52:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-08 01:52:58,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:52:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126603951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:52:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 01:52:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258386828] [2025-03-08 01:52:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:58,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:58,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:58,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:58,327 INFO L87 Difference]: Start difference. First operand 190105 states and 200835 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 01:53:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:01,628 INFO L93 Difference]: Finished difference Result 372314 states and 394182 transitions. [2025-03-08 01:53:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:01,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 489 [2025-03-08 01:53:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:02,161 INFO L225 Difference]: With dead ends: 372314 [2025-03-08 01:53:02,161 INFO L226 Difference]: Without dead ends: 200316 [2025-03-08 01:53:02,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:53:02,229 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1201 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:02,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 384 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:53:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200316 states. [2025-03-08 01:53:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200316 to 200316. [2025-03-08 01:53:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200316 states, 200315 states have (on average 1.0527219629084192) internal successors, (210876), 200315 states have internal predecessors, (210876), 0 states have call successors, (0), 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 01:53:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200316 states to 200316 states and 210876 transitions. [2025-03-08 01:53:04,232 INFO L78 Accepts]: Start accepts. Automaton has 200316 states and 210876 transitions. Word has length 489 [2025-03-08 01:53:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:04,233 INFO L471 AbstractCegarLoop]: Abstraction has 200316 states and 210876 transitions. [2025-03-08 01:53:04,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 01:53:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 200316 states and 210876 transitions. [2025-03-08 01:53:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-08 01:53:04,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:04,267 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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] [2025-03-08 01:53:04,274 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 01:53:04,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:53:04,468 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:04,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1490218171, now seen corresponding path program 1 times [2025-03-08 01:53:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338872825] [2025-03-08 01:53:04,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:04,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-08 01:53:04,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-08 01:53:04,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:04,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 1426 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-08 01:53:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:05,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338872825] [2025-03-08 01:53:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338872825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:05,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:05,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7919270] [2025-03-08 01:53:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:05,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:05,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:05,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:05,206 INFO L87 Difference]: Start difference. First operand 200316 states and 210876 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)