./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem18_label46.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 2a68bea7fd32ae89c685bcf877550bbd817c11891e4cf8a49181c142fa0679e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:07:29,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:07:29,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:07:29,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:07:29,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:07:29,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:07:29,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:07:29,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:07:29,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:07:29,286 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:07:29,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:07:29,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:07:29,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:07:29,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:07:29,287 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:07:29,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:07:29,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:07:29,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:07:29,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:07:29,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:07:29,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:07:29,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:07:29,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:07:29,289 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 -> 2a68bea7fd32ae89c685bcf877550bbd817c11891e4cf8a49181c142fa0679e6 [2025-03-03 11:07:29,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:07:29,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:07:29,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:07:29,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:07:29,529 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:07:29,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label46.c [2025-03-03 11:07:30,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1502a720f/a99cc72e371c431998f219b4396a66b7/FLAG482be4fca [2025-03-03 11:07:31,161 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:07:31,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label46.c [2025-03-03 11:07:31,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1502a720f/a99cc72e371c431998f219b4396a66b7/FLAG482be4fca [2025-03-03 11:07:31,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1502a720f/a99cc72e371c431998f219b4396a66b7 [2025-03-03 11:07:31,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:07:31,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:07:31,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:07:31,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:07:31,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:07:31,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:07:31" (1/1) ... [2025-03-03 11:07:31,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc3da26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:31, skipping insertion in model container [2025-03-03 11:07:31,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:07:31" (1/1) ... [2025-03-03 11:07:31,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:07:31,526 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/Problem18_label46.c[3974,3987] [2025-03-03 11:07:31,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:07:31,891 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:07:31,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label46.c[3974,3987] [2025-03-03 11:07:32,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:07:32,096 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:07:32,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32 WrapperNode [2025-03-03 11:07:32,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:07:32,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:07:32,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:07:32,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:07:32,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,299 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-03 11:07:32,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:07:32,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:07:32,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:07:32,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:07:32,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,413 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-03 11:07:32,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:07:32,530 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:07:32,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:07:32,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:07:32,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (1/1) ... [2025-03-03 11:07:32,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:07:32,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:07:32,556 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-03 11:07:32,559 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-03 11:07:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:07:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:07:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:07:32,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:07:32,651 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:07:32,653 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:07:35,495 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-03 11:07:35,496 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-03 11:07:35,593 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-03 11:07:35,594 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:07:35,624 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:07:35,624 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:07:35,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:07:35 BoogieIcfgContainer [2025-03-03 11:07:35,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:07:35,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:07:35,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:07:35,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:07:35,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:07:31" (1/3) ... [2025-03-03 11:07:35,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220231e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:07:35, skipping insertion in model container [2025-03-03 11:07:35,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:32" (2/3) ... [2025-03-03 11:07:35,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220231e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:07:35, skipping insertion in model container [2025-03-03 11:07:35,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:07:35" (3/3) ... [2025-03-03 11:07:35,633 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label46.c [2025-03-03 11:07:35,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:07:35,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label46.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:07:35,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:07:35,718 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;@207b17ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:07:35,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:07:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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-03 11:07:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 11:07:35,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:35,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:07:35,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:35,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2036495057, now seen corresponding path program 1 times [2025-03-03 11:07:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:35,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549143749] [2025-03-03 11:07:35,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:35,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 11:07:35,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 11:07:35,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:35,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:35,977 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-03 11:07:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:35,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549143749] [2025-03-03 11:07:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549143749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:35,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:07:35,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:07:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702174623] [2025-03-03 11:07:35,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:35,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:07:35,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:35,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:07:35,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:07:35,997 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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-03 11:07:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:38,789 INFO L93 Difference]: Finished difference Result 2221 states and 4279 transitions. [2025-03-03 11:07:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:07:38,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 11:07:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:38,803 INFO L225 Difference]: With dead ends: 2221 [2025-03-03 11:07:38,803 INFO L226 Difference]: Without dead ends: 1384 [2025-03-03 11:07:38,808 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-03 11:07:38,809 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 759 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:38,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 487 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 11:07:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-03 11:07:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-03-03 11:07:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.5994215473608098) internal successors, (2212), 1383 states have internal predecessors, (2212), 0 states have call successors, (0), 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-03 11:07:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2212 transitions. [2025-03-03 11:07:38,885 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2212 transitions. Word has length 36 [2025-03-03 11:07:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:38,886 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2212 transitions. [2025-03-03 11:07:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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-03 11:07:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2212 transitions. [2025-03-03 11:07:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 11:07:38,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:38,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:07:38,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:07:38,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:38,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash 146083108, now seen corresponding path program 1 times [2025-03-03 11:07:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:38,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580741307] [2025-03-03 11:07:38,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:38,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 11:07:38,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 11:07:38,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:38,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:07:39,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:39,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580741307] [2025-03-03 11:07:39,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580741307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:39,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:07:39,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:07:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554442485] [2025-03-03 11:07:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:39,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:07:39,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:39,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:07:39,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:07:39,081 INFO L87 Difference]: Start difference. First operand 1384 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 11:07:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:41,581 INFO L93 Difference]: Finished difference Result 4146 states and 6631 transitions. [2025-03-03 11:07:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:07:41,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-03 11:07:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:41,591 INFO L225 Difference]: With dead ends: 4146 [2025-03-03 11:07:41,591 INFO L226 Difference]: Without dead ends: 2764 [2025-03-03 11:07:41,594 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-03 11:07:41,594 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:41,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 529 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 11:07:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-03-03 11:07:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-03-03 11:07:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.3503438291711907) internal successors, (3731), 2763 states have internal predecessors, (3731), 0 states have call successors, (0), 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-03 11:07:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3731 transitions. [2025-03-03 11:07:41,651 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3731 transitions. Word has length 101 [2025-03-03 11:07:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:41,652 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3731 transitions. [2025-03-03 11:07:41,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 11:07:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3731 transitions. [2025-03-03 11:07:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 11:07:41,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:41,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:07:41,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:07:41,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:41,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash -538532078, now seen corresponding path program 1 times [2025-03-03 11:07:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:41,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484810509] [2025-03-03 11:07:41,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:41,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 11:07:41,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 11:07:41,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:41,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 11:07:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:42,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484810509] [2025-03-03 11:07:42,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484810509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:42,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:07:42,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:07:42,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313844624] [2025-03-03 11:07:42,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:42,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:07:42,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:42,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:07:42,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:07:42,217 INFO L87 Difference]: Start difference. First operand 2764 states and 3731 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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-03 11:07:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:45,345 INFO L93 Difference]: Finished difference Result 7596 states and 9794 transitions. [2025-03-03 11:07:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:07:45,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2025-03-03 11:07:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:45,365 INFO L225 Difference]: With dead ends: 7596 [2025-03-03 11:07:45,367 INFO L226 Difference]: Without dead ends: 4834 [2025-03-03 11:07:45,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:07:45,371 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:45,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 641 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 11:07:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-03-03 11:07:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-03-03 11:07:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.2698527636978034) internal successors, (5261), 4143 states have internal predecessors, (5261), 0 states have call successors, (0), 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-03 11:07:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5261 transitions. [2025-03-03 11:07:45,430 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5261 transitions. Word has length 219 [2025-03-03 11:07:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:45,431 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5261 transitions. [2025-03-03 11:07:45,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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-03 11:07:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5261 transitions. [2025-03-03 11:07:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-03 11:07:45,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:45,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:07:45,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:07:45,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:45,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash 963729255, now seen corresponding path program 1 times [2025-03-03 11:07:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:45,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176767607] [2025-03-03 11:07:45,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:45,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 11:07:45,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 11:07:45,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:45,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:07:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176767607] [2025-03-03 11:07:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176767607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:07:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787857032] [2025-03-03 11:07:45,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:45,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:07:45,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:07:45,882 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-03 11:07:45,884 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-03 11:07:45,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 11:07:46,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 11:07:46,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:46,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:46,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:07:46,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:07:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 11:07:46,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:07:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787857032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:07:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 11:07:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845170264] [2025-03-03 11:07:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:46,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:07:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:46,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:07:46,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:07:46,418 INFO L87 Difference]: Start difference. First operand 4144 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:07:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:48,308 INFO L93 Difference]: Finished difference Result 12426 states and 15778 transitions. [2025-03-03 11:07:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:07:48,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2025-03-03 11:07:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:48,327 INFO L225 Difference]: With dead ends: 12426 [2025-03-03 11:07:48,327 INFO L226 Difference]: Without dead ends: 8284 [2025-03-03 11:07:48,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:07:48,333 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:48,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 550 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:07:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2025-03-03 11:07:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 6904. [2025-03-03 11:07:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.2358394900767782) internal successors, (8531), 6903 states have internal predecessors, (8531), 0 states have call successors, (0), 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-03 11:07:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8531 transitions. [2025-03-03 11:07:48,425 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8531 transitions. Word has length 335 [2025-03-03 11:07:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:48,427 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8531 transitions. [2025-03-03 11:07:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:07:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8531 transitions. [2025-03-03 11:07:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-03 11:07:48,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:48,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:07:48,441 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-03 11:07:48,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:07:48,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:48,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2090592726, now seen corresponding path program 1 times [2025-03-03 11:07:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:48,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71825620] [2025-03-03 11:07:48,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:48,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-03 11:07:48,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-03 11:07:48,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:48,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-03 11:07:49,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:49,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71825620] [2025-03-03 11:07:49,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71825620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:49,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:07:49,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:07:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248170197] [2025-03-03 11:07:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:49,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:07:49,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:49,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:07:49,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:07:49,027 INFO L87 Difference]: Start difference. First operand 6904 states and 8531 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-03 11:07:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:50,879 INFO L93 Difference]: Finished difference Result 15239 states and 18535 transitions. [2025-03-03 11:07:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:07:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 405 [2025-03-03 11:07:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:50,896 INFO L225 Difference]: With dead ends: 15239 [2025-03-03 11:07:50,896 INFO L226 Difference]: Without dead ends: 8284 [2025-03-03 11:07:50,900 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-03 11:07:50,901 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:50,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 637 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:07:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2025-03-03 11:07:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2025-03-03 11:07:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.154291923216226) internal successors, (9561), 8283 states have internal predecessors, (9561), 0 states have call successors, (0), 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-03 11:07:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9561 transitions. [2025-03-03 11:07:50,997 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 9561 transitions. Word has length 405 [2025-03-03 11:07:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:50,999 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 9561 transitions. [2025-03-03 11:07:50,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-03 11:07:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 9561 transitions. [2025-03-03 11:07:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-03 11:07:51,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:51,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:07:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:07:51,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 185222620, now seen corresponding path program 1 times [2025-03-03 11:07:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490091220] [2025-03-03 11:07:51,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:51,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-03 11:07:51,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-03 11:07:51,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:51,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 11:07:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490091220] [2025-03-03 11:07:51,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490091220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:51,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:07:51,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:07:51,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070501921] [2025-03-03 11:07:51,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:51,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:07:51,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:51,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:07:51,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:07:51,220 INFO L87 Difference]: Start difference. First operand 8284 states and 9561 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 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-03 11:07:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:52,881 INFO L93 Difference]: Finished difference Result 20016 states and 22949 transitions. [2025-03-03 11:07:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:07:52,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 420 [2025-03-03 11:07:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:52,908 INFO L225 Difference]: With dead ends: 20016 [2025-03-03 11:07:52,908 INFO L226 Difference]: Without dead ends: 11734 [2025-03-03 11:07:52,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:07:52,916 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:52,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:07:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2025-03-03 11:07:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11734. [2025-03-03 11:07:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11734 states, 11733 states have (on average 1.119151112247507) internal successors, (13131), 11733 states have internal predecessors, (13131), 0 states have call successors, (0), 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-03 11:07:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13131 transitions. [2025-03-03 11:07:53,038 INFO L78 Accepts]: Start accepts. Automaton has 11734 states and 13131 transitions. Word has length 420 [2025-03-03 11:07:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:53,039 INFO L471 AbstractCegarLoop]: Abstraction has 11734 states and 13131 transitions. [2025-03-03 11:07:53,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 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-03 11:07:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 11734 states and 13131 transitions. [2025-03-03 11:07:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-03 11:07:53,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:53,043 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:07:53,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:07:53,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:53,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1005129032, now seen corresponding path program 1 times [2025-03-03 11:07:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:53,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554828219] [2025-03-03 11:07:53,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:53,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:53,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-03 11:07:53,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-03 11:07:53,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:53,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:07:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554828219] [2025-03-03 11:07:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554828219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:53,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:07:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:07:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656499045] [2025-03-03 11:07:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:53,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:07:53,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:53,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:07:53,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:07:53,419 INFO L87 Difference]: Start difference. First operand 11734 states and 13131 transitions. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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-03 11:07:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:54,992 INFO L93 Difference]: Finished difference Result 32436 states and 36566 transitions. [2025-03-03 11:07:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:07:54,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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 428 [2025-03-03 11:07:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:55,028 INFO L225 Difference]: With dead ends: 32436 [2025-03-03 11:07:55,028 INFO L226 Difference]: Without dead ends: 20704 [2025-03-03 11:07:55,041 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-03 11:07:55,042 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 601 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:55,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 978 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:07:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2025-03-03 11:07:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20704. [2025-03-03 11:07:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.0932232043665169) internal successors, (22633), 20703 states have internal predecessors, (22633), 0 states have call successors, (0), 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-03 11:07:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 22633 transitions. [2025-03-03 11:07:55,279 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 22633 transitions. Word has length 428 [2025-03-03 11:07:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:55,279 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 22633 transitions. [2025-03-03 11:07:55,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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-03 11:07:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 22633 transitions. [2025-03-03 11:07:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-03 11:07:55,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:55,284 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:07:55,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:07:55,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:55,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash -292631835, now seen corresponding path program 1 times [2025-03-03 11:07:55,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:55,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628862757] [2025-03-03 11:07:55,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:55,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:55,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-03 11:07:55,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-03 11:07:55,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:55,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-03 11:07:55,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:55,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628862757] [2025-03-03 11:07:55,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628862757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:55,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:07:55,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:07:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014657914] [2025-03-03 11:07:55,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:55,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:07:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:55,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:07:55,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:07:55,446 INFO L87 Difference]: Start difference. First operand 20704 states and 22633 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-03 11:07:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:57,131 INFO L93 Difference]: Finished difference Result 48306 states and 53266 transitions. [2025-03-03 11:07:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:07:57,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 435 [2025-03-03 11:07:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:57,168 INFO L225 Difference]: With dead ends: 48306 [2025-03-03 11:07:57,168 INFO L226 Difference]: Without dead ends: 27604 [2025-03-03 11:07:57,186 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-03 11:07:57,186 INFO L435 NwaCegarLoop]: 1111 mSDtfsCounter, 664 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:57,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1118 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:07:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27604 states. [2025-03-03 11:07:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27604 to 26914. [2025-03-03 11:07:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26914 states, 26913 states have (on average 1.0879129045442724) internal successors, (29279), 26913 states have internal predecessors, (29279), 0 states have call successors, (0), 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-03 11:07:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26914 states to 26914 states and 29279 transitions. [2025-03-03 11:07:57,486 INFO L78 Accepts]: Start accepts. Automaton has 26914 states and 29279 transitions. Word has length 435 [2025-03-03 11:07:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:57,487 INFO L471 AbstractCegarLoop]: Abstraction has 26914 states and 29279 transitions. [2025-03-03 11:07:57,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-03 11:07:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 26914 states and 29279 transitions. [2025-03-03 11:07:57,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-03 11:07:57,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:57,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:07:57,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:07:57,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:57,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1935312836, now seen corresponding path program 1 times [2025-03-03 11:07:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:57,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354811716] [2025-03-03 11:07:57,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:57,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:57,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-03 11:07:57,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 11:07:57,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:57,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:07:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-03 11:07:57,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:07:57,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354811716] [2025-03-03 11:07:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354811716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:07:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:07:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:07:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865675191] [2025-03-03 11:07:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:07:57,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:07:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:07:57,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:07:57,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:07:57,788 INFO L87 Difference]: Start difference. First operand 26914 states and 29279 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-03 11:07:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:07:59,467 INFO L93 Difference]: Finished difference Result 60036 states and 66062 transitions. [2025-03-03 11:07:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:07:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 460 [2025-03-03 11:07:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:07:59,518 INFO L225 Difference]: With dead ends: 60036 [2025-03-03 11:07:59,518 INFO L226 Difference]: Without dead ends: 33124 [2025-03-03 11:07:59,540 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-03 11:07:59,541 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 695 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:07:59,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 932 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:07:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33124 states. [2025-03-03 11:07:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33124 to 33124. [2025-03-03 11:07:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.0809407360444405) internal successors, (35804), 33123 states have internal predecessors, (35804), 0 states have call successors, (0), 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-03 11:07:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 35804 transitions. [2025-03-03 11:07:59,915 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 35804 transitions. Word has length 460 [2025-03-03 11:07:59,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:07:59,916 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 35804 transitions. [2025-03-03 11:07:59,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-03 11:07:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 35804 transitions. [2025-03-03 11:07:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-03 11:07:59,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:07:59,920 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:07:59,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:07:59,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:07:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:07:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1781381967, now seen corresponding path program 1 times [2025-03-03 11:07:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:07:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789468973] [2025-03-03 11:07:59,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:07:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:07:59,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 11:07:59,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 11:07:59,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:07:59,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-03 11:08:00,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:00,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789468973] [2025-03-03 11:08:00,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789468973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:00,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:00,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:08:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912141939] [2025-03-03 11:08:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:00,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:00,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:00,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:00,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:08:00,166 INFO L87 Difference]: Start difference. First operand 33124 states and 35804 transitions. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-03 11:08:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:01,826 INFO L93 Difference]: Finished difference Result 77286 states and 84152 transitions. [2025-03-03 11:08:01,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:01,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 529 [2025-03-03 11:08:01,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:01,879 INFO L225 Difference]: With dead ends: 77286 [2025-03-03 11:08:01,880 INFO L226 Difference]: Without dead ends: 39334 [2025-03-03 11:08:01,903 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-03 11:08:01,904 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 639 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:01,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1095 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:08:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39334 states. [2025-03-03 11:08:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 36574. [2025-03-03 11:08:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36574 states, 36573 states have (on average 1.0474393678396632) internal successors, (38308), 36573 states have internal predecessors, (38308), 0 states have call successors, (0), 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-03 11:08:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36574 states to 36574 states and 38308 transitions. [2025-03-03 11:08:02,389 INFO L78 Accepts]: Start accepts. Automaton has 36574 states and 38308 transitions. Word has length 529 [2025-03-03 11:08:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:02,390 INFO L471 AbstractCegarLoop]: Abstraction has 36574 states and 38308 transitions. [2025-03-03 11:08:02,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-03 11:08:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 36574 states and 38308 transitions. [2025-03-03 11:08:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-03 11:08:02,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:02,395 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:08:02,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:02,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1098854367, now seen corresponding path program 1 times [2025-03-03 11:08:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:02,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15650381] [2025-03-03 11:08:02,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:02,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-03 11:08:02,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-03 11:08:02,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:02,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-03 11:08:02,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:02,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15650381] [2025-03-03 11:08:02,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15650381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:02,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:02,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:08:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848116084] [2025-03-03 11:08:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:02,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:02,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:02,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:02,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:08:02,604 INFO L87 Difference]: Start difference. First operand 36574 states and 38308 transitions. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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-03 11:08:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:04,265 INFO L93 Difference]: Finished difference Result 81426 states and 85683 transitions. [2025-03-03 11:08:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:04,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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 578 [2025-03-03 11:08:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:04,309 INFO L225 Difference]: With dead ends: 81426 [2025-03-03 11:08:04,309 INFO L226 Difference]: Without dead ends: 44854 [2025-03-03 11:08:04,330 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-03 11:08:04,330 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 603 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:04,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 298 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:08:04,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44854 states. [2025-03-03 11:08:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44854 to 44164. [2025-03-03 11:08:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44164 states, 44163 states have (on average 1.0461019405384597) internal successors, (46199), 44163 states have internal predecessors, (46199), 0 states have call successors, (0), 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-03 11:08:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44164 states to 44164 states and 46199 transitions. [2025-03-03 11:08:04,823 INFO L78 Accepts]: Start accepts. Automaton has 44164 states and 46199 transitions. Word has length 578 [2025-03-03 11:08:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:04,824 INFO L471 AbstractCegarLoop]: Abstraction has 44164 states and 46199 transitions. [2025-03-03 11:08:04,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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-03 11:08:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 44164 states and 46199 transitions. [2025-03-03 11:08:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2025-03-03 11:08:04,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:04,840 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:04,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:08:04,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:04,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1088795344, now seen corresponding path program 1 times [2025-03-03 11:08:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411636937] [2025-03-03 11:08:04,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:04,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:04,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1111 statements into 1 equivalence classes. [2025-03-03 11:08:04,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1111 of 1111 statements. [2025-03-03 11:08:04,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:04,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 430 proven. 555 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-03-03 11:08:06,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411636937] [2025-03-03 11:08:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411636937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:08:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256158419] [2025-03-03 11:08:06,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:06,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:08:06,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:08:06,021 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-03 11:08:06,023 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-03 11:08:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1111 statements into 1 equivalence classes. [2025-03-03 11:08:06,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1111 of 1111 statements. [2025-03-03 11:08:06,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:06,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:06,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:08:06,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:08:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-03 11:08:06,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:08:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256158419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:08:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 11:08:06,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946548418] [2025-03-03 11:08:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:06,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:06,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:08:06,363 INFO L87 Difference]: Start difference. First operand 44164 states and 46199 transitions. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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-03 11:08:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:07,905 INFO L93 Difference]: Finished difference Result 99366 states and 104481 transitions. [2025-03-03 11:08:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:07,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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 1111 [2025-03-03 11:08:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:07,961 INFO L225 Difference]: With dead ends: 99366 [2025-03-03 11:08:07,961 INFO L226 Difference]: Without dead ends: 51754 [2025-03-03 11:08:07,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:08:07,990 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 625 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:07,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 873 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:08:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51754 states. [2025-03-03 11:08:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51754 to 51754. [2025-03-03 11:08:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51754 states, 51753 states have (on average 1.0478233145904585) internal successors, (54228), 51753 states have internal predecessors, (54228), 0 states have call successors, (0), 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-03 11:08:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51754 states to 51754 states and 54228 transitions. [2025-03-03 11:08:08,448 INFO L78 Accepts]: Start accepts. Automaton has 51754 states and 54228 transitions. Word has length 1111 [2025-03-03 11:08:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:08,448 INFO L471 AbstractCegarLoop]: Abstraction has 51754 states and 54228 transitions. [2025-03-03 11:08:08,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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-03 11:08:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51754 states and 54228 transitions. [2025-03-03 11:08:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1226 [2025-03-03 11:08:08,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:08,461 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:08,468 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-03 11:08:08,661 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,SelfDestructingSolverStorable11 [2025-03-03 11:08:08,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:08,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1668331987, now seen corresponding path program 1 times [2025-03-03 11:08:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106551634] [2025-03-03 11:08:08,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:08,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:08,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1225 statements into 1 equivalence classes. [2025-03-03 11:08:08,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1225 of 1225 statements. [2025-03-03 11:08:08,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:08,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-03 11:08:09,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:09,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106551634] [2025-03-03 11:08:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106551634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:09,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:08:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183158769] [2025-03-03 11:08:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:09,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:09,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:09,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:08:09,306 INFO L87 Difference]: Start difference. First operand 51754 states and 54228 transitions. Second operand has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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-03 11:08:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:10,997 INFO L93 Difference]: Finished difference Result 112476 states and 118332 transitions. [2025-03-03 11:08:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:10,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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 1225 [2025-03-03 11:08:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:11,065 INFO L225 Difference]: With dead ends: 112476 [2025-03-03 11:08:11,065 INFO L226 Difference]: Without dead ends: 61414 [2025-03-03 11:08:11,100 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-03 11:08:11,101 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 490 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:11,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 954 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:08:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61414 states. [2025-03-03 11:08:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 61414. [2025-03-03 11:08:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0452835718821747) internal successors, (64194), 61413 states have internal predecessors, (64194), 0 states have call successors, (0), 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-03 11:08:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 64194 transitions. [2025-03-03 11:08:11,960 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 64194 transitions. Word has length 1225 [2025-03-03 11:08:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:11,961 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 64194 transitions. [2025-03-03 11:08:11,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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-03 11:08:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 64194 transitions. [2025-03-03 11:08:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2025-03-03 11:08:11,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:11,978 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:11,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:08:11,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:11,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1224451068, now seen corresponding path program 1 times [2025-03-03 11:08:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:11,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750165917] [2025-03-03 11:08:11,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:12,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1349 statements into 1 equivalence classes. [2025-03-03 11:08:12,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1349 of 1349 statements. [2025-03-03 11:08:12,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:12,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2115 backedges. 1199 proven. 0 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-03 11:08:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:12,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750165917] [2025-03-03 11:08:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750165917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:12,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:08:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129749504] [2025-03-03 11:08:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:12,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:12,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:12,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:08:12,617 INFO L87 Difference]: Start difference. First operand 61414 states and 64194 transitions. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 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-03 11:08:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:13,977 INFO L93 Difference]: Finished difference Result 122136 states and 127695 transitions. [2025-03-03 11:08:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 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 1349 [2025-03-03 11:08:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:14,052 INFO L225 Difference]: With dead ends: 122136 [2025-03-03 11:08:14,052 INFO L226 Difference]: Without dead ends: 61414 [2025-03-03 11:08:14,090 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-03 11:08:14,090 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 552 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:14,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 925 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:08:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61414 states. [2025-03-03 11:08:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 60724. [2025-03-03 11:08:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60724 states, 60723 states have (on average 1.040561237093029) internal successors, (63186), 60723 states have internal predecessors, (63186), 0 states have call successors, (0), 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-03 11:08:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60724 states to 60724 states and 63186 transitions. [2025-03-03 11:08:14,757 INFO L78 Accepts]: Start accepts. Automaton has 60724 states and 63186 transitions. Word has length 1349 [2025-03-03 11:08:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:14,758 INFO L471 AbstractCegarLoop]: Abstraction has 60724 states and 63186 transitions. [2025-03-03 11:08:14,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 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-03 11:08:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 60724 states and 63186 transitions. [2025-03-03 11:08:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1369 [2025-03-03 11:08:14,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:14,776 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:14,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:08:14,776 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:14,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash 602263267, now seen corresponding path program 1 times [2025-03-03 11:08:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895040647] [2025-03-03 11:08:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:14,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1368 statements into 1 equivalence classes. [2025-03-03 11:08:14,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1368 of 1368 statements. [2025-03-03 11:08:14,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:14,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 1412 proven. 0 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2025-03-03 11:08:15,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:15,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895040647] [2025-03-03 11:08:15,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895040647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:15,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:15,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:08:15,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776761990] [2025-03-03 11:08:15,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:08:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:15,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:08:15,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:08:15,909 INFO L87 Difference]: Start difference. First operand 60724 states and 63186 transitions. Second operand has 5 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 0 states have call successors, (0), 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-03 11:08:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:18,501 INFO L93 Difference]: Finished difference Result 121446 states and 126396 transitions. [2025-03-03 11:08:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:08:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 0 states have call successors, (0), 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 1368 [2025-03-03 11:08:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:18,566 INFO L225 Difference]: With dead ends: 121446 [2025-03-03 11:08:18,566 INFO L226 Difference]: Without dead ends: 61414 [2025-03-03 11:08:18,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:08:18,602 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 1235 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 4667 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:18,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 1598 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 4667 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 11:08:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61414 states. [2025-03-03 11:08:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 61414. [2025-03-03 11:08:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0386725937505088) internal successors, (63788), 61413 states have internal predecessors, (63788), 0 states have call successors, (0), 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-03 11:08:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63788 transitions. [2025-03-03 11:08:19,125 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63788 transitions. Word has length 1368 [2025-03-03 11:08:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:19,126 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63788 transitions. [2025-03-03 11:08:19,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 0 states have call successors, (0), 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-03 11:08:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63788 transitions. [2025-03-03 11:08:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1374 [2025-03-03 11:08:19,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:19,165 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:19,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:08:19,166 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:19,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1248380007, now seen corresponding path program 1 times [2025-03-03 11:08:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313268778] [2025-03-03 11:08:19,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:19,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1373 statements into 1 equivalence classes. [2025-03-03 11:08:19,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1373 of 1373 statements. [2025-03-03 11:08:19,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:19,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 1450 proven. 0 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2025-03-03 11:08:20,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:20,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313268778] [2025-03-03 11:08:20,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313268778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:20,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:20,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:08:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244513398] [2025-03-03 11:08:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:20,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:08:20,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:20,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:08:20,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:08:20,438 INFO L87 Difference]: Start difference. First operand 61414 states and 63788 transitions. Second operand has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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-03 11:08:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:22,509 INFO L93 Difference]: Finished difference Result 123516 states and 128279 transitions. [2025-03-03 11:08:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:08:22,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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 1373 [2025-03-03 11:08:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:22,577 INFO L225 Difference]: With dead ends: 123516 [2025-03-03 11:08:22,577 INFO L226 Difference]: Without dead ends: 62794 [2025-03-03 11:08:22,614 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-03 11:08:22,616 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 799 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:22,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 91 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2735 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:08:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62794 states. [2025-03-03 11:08:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62794 to 61414. [2025-03-03 11:08:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0384771953820853) internal successors, (63776), 61413 states have internal predecessors, (63776), 0 states have call successors, (0), 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-03 11:08:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63776 transitions. [2025-03-03 11:08:23,103 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63776 transitions. Word has length 1373 [2025-03-03 11:08:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:23,104 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63776 transitions. [2025-03-03 11:08:23,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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-03 11:08:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63776 transitions. [2025-03-03 11:08:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1399 [2025-03-03 11:08:23,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:23,121 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:23,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:08:23,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:23,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1889672979, now seen corresponding path program 1 times [2025-03-03 11:08:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:23,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288708433] [2025-03-03 11:08:23,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:23,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1398 statements into 1 equivalence classes. [2025-03-03 11:08:23,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1398 of 1398 statements. [2025-03-03 11:08:23,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:23,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2213 backedges. 1402 proven. 49 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-03 11:08:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288708433] [2025-03-03 11:08:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288708433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:08:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5162200] [2025-03-03 11:08:24,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:24,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:08:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:08:24,402 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-03 11:08:24,403 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-03 11:08:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1398 statements into 1 equivalence classes. [2025-03-03 11:08:24,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1398 of 1398 statements. [2025-03-03 11:08:24,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:24,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:24,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:08:24,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:08:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2213 backedges. 954 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-03-03 11:08:24,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:08:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5162200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:24,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:08:24,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 11:08:24,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324070206] [2025-03-03 11:08:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:24,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:24,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:24,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:08:24,925 INFO L87 Difference]: Start difference. First operand 61414 states and 63776 transitions. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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-03 11:08:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:26,703 INFO L93 Difference]: Finished difference Result 144906 states and 150701 transitions. [2025-03-03 11:08:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:26,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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 1398 [2025-03-03 11:08:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:26,800 INFO L225 Difference]: With dead ends: 144906 [2025-03-03 11:08:26,800 INFO L226 Difference]: Without dead ends: 84184 [2025-03-03 11:08:26,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1402 GetRequests, 1398 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:08:26,836 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 525 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:26,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 101 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:08:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84184 states. [2025-03-03 11:08:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84184 to 81424. [2025-03-03 11:08:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81424 states, 81423 states have (on average 1.0379008388293234) internal successors, (84509), 81423 states have internal predecessors, (84509), 0 states have call successors, (0), 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-03 11:08:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81424 states to 81424 states and 84509 transitions. [2025-03-03 11:08:27,525 INFO L78 Accepts]: Start accepts. Automaton has 81424 states and 84509 transitions. Word has length 1398 [2025-03-03 11:08:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:27,526 INFO L471 AbstractCegarLoop]: Abstraction has 81424 states and 84509 transitions. [2025-03-03 11:08:27,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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-03 11:08:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 81424 states and 84509 transitions. [2025-03-03 11:08:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2025-03-03 11:08:27,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:27,543 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:27,550 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-03 11:08:27,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:08:27,743 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:27,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash 481703815, now seen corresponding path program 1 times [2025-03-03 11:08:27,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:27,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155650215] [2025-03-03 11:08:27,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:27,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:27,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1428 statements into 1 equivalence classes. [2025-03-03 11:08:27,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1428 of 1428 statements. [2025-03-03 11:08:27,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:27,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1847 proven. 0 refuted. 0 times theorem prover too weak. 1041 trivial. 0 not checked. [2025-03-03 11:08:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155650215] [2025-03-03 11:08:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155650215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:28,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:28,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:08:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259988079] [2025-03-03 11:08:28,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:28,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:28,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:28,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:08:28,268 INFO L87 Difference]: Start difference. First operand 81424 states and 84509 transitions. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 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-03 11:08:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:29,745 INFO L93 Difference]: Finished difference Result 162846 states and 169016 transitions. [2025-03-03 11:08:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 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 1428 [2025-03-03 11:08:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:29,832 INFO L225 Difference]: With dead ends: 162846 [2025-03-03 11:08:29,832 INFO L226 Difference]: Without dead ends: 82114 [2025-03-03 11:08:29,878 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-03 11:08:29,878 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 587 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:29,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 943 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:08:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82114 states. [2025-03-03 11:08:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82114 to 81424. [2025-03-03 11:08:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81424 states, 81423 states have (on average 1.0364270537808726) internal successors, (84389), 81423 states have internal predecessors, (84389), 0 states have call successors, (0), 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-03 11:08:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81424 states to 81424 states and 84389 transitions. [2025-03-03 11:08:30,528 INFO L78 Accepts]: Start accepts. Automaton has 81424 states and 84389 transitions. Word has length 1428 [2025-03-03 11:08:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 81424 states and 84389 transitions. [2025-03-03 11:08:30,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 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-03 11:08:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 81424 states and 84389 transitions. [2025-03-03 11:08:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1453 [2025-03-03 11:08:30,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:30,546 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:30,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:08:30,546 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:30,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash -132133738, now seen corresponding path program 1 times [2025-03-03 11:08:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372554192] [2025-03-03 11:08:30,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:30,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1452 statements into 1 equivalence classes. [2025-03-03 11:08:30,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1452 of 1452 statements. [2025-03-03 11:08:30,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:30,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2749 backedges. 1456 proven. 0 refuted. 0 times theorem prover too weak. 1293 trivial. 0 not checked. [2025-03-03 11:08:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372554192] [2025-03-03 11:08:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372554192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:31,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:31,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:08:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244456394] [2025-03-03 11:08:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:31,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:31,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:31,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:08:31,799 INFO L87 Difference]: Start difference. First operand 81424 states and 84389 transitions. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 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-03 11:08:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:33,619 INFO L93 Difference]: Finished difference Result 183546 states and 190508 transitions. [2025-03-03 11:08:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:33,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 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 1452 [2025-03-03 11:08:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:33,726 INFO L225 Difference]: With dead ends: 183546 [2025-03-03 11:08:33,727 INFO L226 Difference]: Without dead ends: 102814 [2025-03-03 11:08:33,777 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-03 11:08:33,778 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 606 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:33,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 957 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:08:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102814 states. [2025-03-03 11:08:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102814 to 100744. [2025-03-03 11:08:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100744 states, 100743 states have (on average 1.032399273398648) internal successors, (104007), 100743 states have internal predecessors, (104007), 0 states have call successors, (0), 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-03 11:08:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100744 states to 100744 states and 104007 transitions. [2025-03-03 11:08:34,684 INFO L78 Accepts]: Start accepts. Automaton has 100744 states and 104007 transitions. Word has length 1452 [2025-03-03 11:08:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:34,685 INFO L471 AbstractCegarLoop]: Abstraction has 100744 states and 104007 transitions. [2025-03-03 11:08:34,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 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-03 11:08:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 100744 states and 104007 transitions. [2025-03-03 11:08:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1464 [2025-03-03 11:08:34,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:34,720 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:34,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:08:34,721 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:34,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:34,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1744858478, now seen corresponding path program 1 times [2025-03-03 11:08:34,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:34,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000569210] [2025-03-03 11:08:34,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:34,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:34,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1463 statements into 1 equivalence classes. [2025-03-03 11:08:34,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1463 of 1463 statements. [2025-03-03 11:08:34,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:34,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2086 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 1915 trivial. 0 not checked. [2025-03-03 11:08:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:35,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000569210] [2025-03-03 11:08:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000569210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:35,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:35,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:08:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714263072] [2025-03-03 11:08:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:35,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:08:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:35,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:08:35,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:08:35,596 INFO L87 Difference]: Start difference. First operand 100744 states and 104007 transitions. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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-03 11:08:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:37,398 INFO L93 Difference]: Finished difference Result 197346 states and 203766 transitions. [2025-03-03 11:08:37,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:08:37,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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 1463 [2025-03-03 11:08:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:37,517 INFO L225 Difference]: With dead ends: 197346 [2025-03-03 11:08:37,517 INFO L226 Difference]: Without dead ends: 97294 [2025-03-03 11:08:37,582 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-03 11:08:37,582 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 722 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:37,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 888 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:08:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97294 states. [2025-03-03 11:08:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97294 to 95224. [2025-03-03 11:08:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95224 states, 95223 states have (on average 1.0219694821629228) internal successors, (97315), 95223 states have internal predecessors, (97315), 0 states have call successors, (0), 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-03 11:08:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95224 states to 95224 states and 97315 transitions. [2025-03-03 11:08:38,736 INFO L78 Accepts]: Start accepts. Automaton has 95224 states and 97315 transitions. Word has length 1463 [2025-03-03 11:08:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:38,737 INFO L471 AbstractCegarLoop]: Abstraction has 95224 states and 97315 transitions. [2025-03-03 11:08:38,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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-03 11:08:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 95224 states and 97315 transitions. [2025-03-03 11:08:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1648 [2025-03-03 11:08:38,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:08:38,769 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:08:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:08:38,770 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:08:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:08:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2063506300, now seen corresponding path program 1 times [2025-03-03 11:08:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:08:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837136519] [2025-03-03 11:08:38,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:08:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:08:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1647 statements into 1 equivalence classes. [2025-03-03 11:08:38,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1647 of 1647 statements. [2025-03-03 11:08:38,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:08:38,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:08:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 1298 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2025-03-03 11:08:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:08:39,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837136519] [2025-03-03 11:08:39,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837136519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:08:39,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:08:39,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:08:39,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555252351] [2025-03-03 11:08:39,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:08:39,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:08:39,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:08:39,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:08:39,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:08:39,611 INFO L87 Difference]: Start difference. First operand 95224 states and 97315 transitions. Second operand has 4 states, 4 states have (on average 214.75) internal successors, (859), 4 states have internal predecessors, (859), 0 states have call successors, (0), 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-03 11:08:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:08:41,569 INFO L93 Difference]: Finished difference Result 191831 states and 196016 transitions. [2025-03-03 11:08:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:08:41,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 214.75) internal successors, (859), 4 states have internal predecessors, (859), 0 states have call successors, (0), 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 1647 [2025-03-03 11:08:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:08:41,571 INFO L225 Difference]: With dead ends: 191831 [2025-03-03 11:08:41,571 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 11:08:41,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:08:41,611 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 397 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:08:41,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 937 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:08:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 11:08:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 11:08:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:08:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 11:08:41,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1647 [2025-03-03 11:08:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:08:41,612 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 11:08:41,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 214.75) internal successors, (859), 4 states have internal predecessors, (859), 0 states have call successors, (0), 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-03 11:08:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 11:08:41,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 11:08:41,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 11:08:41,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:08:41,617 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:08:41,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 11:08:43,881 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:08:43,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:08:43 BoogieIcfgContainer [2025-03-03 11:08:43,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:08:43,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:08:43,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:08:43,895 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:08:43,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:07:35" (3/4) ... [2025-03-03 11:08:43,897 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 11:08:43,929 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-03 11:08:43,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 11:08:43,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 11:08:43,938 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 11:08:44,147 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 11:08:44,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 11:08:44,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:08:44,150 INFO L158 Benchmark]: Toolchain (without parser) took 72834.16ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 96.1MB in the beginning and 349.5MB in the end (delta: -253.4MB). Peak memory consumption was 918.3MB. Max. memory is 16.1GB. [2025-03-03 11:08:44,150 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:08:44,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 779.90ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 51.1MB in the end (delta: 44.9MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2025-03-03 11:08:44,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 200.85ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 66.1MB in the end (delta: -15.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2025-03-03 11:08:44,151 INFO L158 Benchmark]: Boogie Preprocessor took 229.83ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 49.2MB in the end (delta: 16.9MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-03-03 11:08:44,151 INFO L158 Benchmark]: IcfgBuilder took 3094.59ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 49.2MB in the beginning and 166.9MB in the end (delta: -117.7MB). Peak memory consumption was 199.4MB. Max. memory is 16.1GB. [2025-03-03 11:08:44,151 INFO L158 Benchmark]: TraceAbstraction took 68267.21ms. Allocated memory was 369.1MB in the beginning and 1.3GB in the end (delta: 947.9MB). Free memory was 166.9MB in the beginning and 399.8MB in the end (delta: -232.9MB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-03-03 11:08:44,151 INFO L158 Benchmark]: Witness Printer took 254.90ms. Allocated memory is still 1.3GB. Free memory was 399.8MB in the beginning and 349.5MB in the end (delta: 50.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 11:08:44,152 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 779.90ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 51.1MB in the end (delta: 44.9MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 200.85ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 66.1MB in the end (delta: -15.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 229.83ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 49.2MB in the end (delta: 16.9MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * IcfgBuilder took 3094.59ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 49.2MB in the beginning and 166.9MB in the end (delta: -117.7MB). Peak memory consumption was 199.4MB. Max. memory is 16.1GB. * TraceAbstraction took 68267.21ms. Allocated memory was 369.1MB in the beginning and 1.3GB in the end (delta: 947.9MB). Free memory was 166.9MB in the beginning and 399.8MB in the end (delta: -232.9MB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 254.90ms. Allocated memory is still 1.3GB. Free memory was 399.8MB in the beginning and 349.5MB in the end (delta: 50.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 127]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.9s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 41.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14479 SdHoareTripleChecker+Valid, 35.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14479 mSDsluCounter, 15609 SdHoareTripleChecker+Invalid, 28.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 800 mSDsCounter, 7051 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45672 IncrementalHoareTripleChecker+Invalid, 52723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7051 mSolverCounterUnsat, 14809 mSDtfsCounter, 45672 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2911 GetRequests, 2873 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100744occurred in iteration=19, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 15870 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 20604 NumberOfCodeBlocks, 20604 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 20580 ConstructedInterpolants, 0 QuantifiedInterpolants, 42906 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3325 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 27214/27851 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4269]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((a24 == 3) && (a15 <= 4)) && (a3 <= 417)) || ((a24 == 3) && (5 == a15))) || (((a24 == 2) && (a3 <= 417)) && (a15 == 6))) || (((5 == a15) && (a24 == 2)) && (a18 == 9))) || (((a18 == 10) && (a24 == 2)) && (a15 == 6))) || (((5 == a15) && (a18 == 10)) && (a24 == 2))) || (((a24 == 2) && (a18 == 9)) && (a15 == 6))) || (((a15 == 4) && (a18 <= 8)) && (a3 <= 99))) || (((5 == a15) && (a18 == 10)) && (a24 == 4))) || ((a24 == 0) && (5 == a15))) || (((5 == a15) && (a24 == 4)) && (a3 <= 417))) || (((a24 == 3) && (a15 <= 4)) && (a18 == 10))) || ((a24 == 0) && (a15 == 6))) || ((a15 <= 4) && (a24 <= 1))) || ((a15 <= 4) && (a24 == 4))) || (((a15 <= 4) && (a24 <= 3)) && (a3 <= 99))) || ((((307 <= a3) && (a15 <= 4)) && (a24 <= 3)) && (a3 <= 417))) || ((((a15 == 4) && (418 <= a3)) && (a24 == 2)) && (a18 == 11))) || (((a18 <= 8) && (a24 == 2)) && (a15 == 6))) || ((a24 == 1) && (a15 == 6))) || (((5 == a15) && (a24 == 2)) && (a3 <= 417))) || ((a24 == 3) && (a15 == 6))) || ((a24 == 1) && (5 == a15))) || (((a24 == 2) && (a18 == 12)) && (a15 == 6))) || (((a15 <= 4) && (a24 == 2)) && (a18 == 9))) || (((a18 <= 8) && (a15 <= 4)) && (a24 <= 3))) || (((5 == a15) && (a24 == 2)) && (a18 == 12))) RESULT: Ultimate proved your program to be correct! [2025-03-03 11:08:44,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE