./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label27.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 e8feab662bc73c18f88b757dfbe2687c764aa0043a35ed648ed6332a38c0448d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:01:30,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:01:30,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:01:30,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:01:30,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:01:30,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:01:30,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:01:30,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:01:30,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:01:30,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:01:30,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:01:30,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:01:30,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:01:30,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:01:30,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:01:30,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:01:30,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:01:30,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:01:30,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:01:30,325 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 -> e8feab662bc73c18f88b757dfbe2687c764aa0043a35ed648ed6332a38c0448d [2025-03-16 15:01:30,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:01:30,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:01:30,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:01:30,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:01:30,578 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:01:30,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label27.c [2025-03-16 15:01:31,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c1043b9/306b09dc48e34fba96b3122aa478fb73/FLAG17a3dc121 [2025-03-16 15:01:32,202 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:01:32,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c [2025-03-16 15:01:32,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c1043b9/306b09dc48e34fba96b3122aa478fb73/FLAG17a3dc121 [2025-03-16 15:01:32,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c1043b9/306b09dc48e34fba96b3122aa478fb73 [2025-03-16 15:01:32,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:01:32,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:01:32,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:01:32,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:01:32,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:01:32,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:01:32" (1/1) ... [2025-03-16 15:01:32,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34dc6e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:32, skipping insertion in model container [2025-03-16 15:01:32,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:01:32" (1/1) ... [2025-03-16 15:01:32,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:01:32,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c[6468,6481] [2025-03-16 15:01:33,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:01:33,040 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:01:33,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c[6468,6481] [2025-03-16 15:01:33,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:01:33,351 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:01:33,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33 WrapperNode [2025-03-16 15:01:33,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:01:33,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:01:33,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:01:33,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:01:33,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:33,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:33,798 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:01:33,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:01:33,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:01:33,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:01:33,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:01:33,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:33,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:33,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:34,138 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:01:34,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:34,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:34,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:34,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:34,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:34,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:34,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:01:34,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:01:34,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:01:34,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:01:34,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (1/1) ... [2025-03-16 15:01:34,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:01:34,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:01:34,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:01:34,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:01:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:01:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:01:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:01:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:01:34,433 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:01:34,434 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:01:38,363 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:01:38,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:01:38,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:01:38,570 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:01:38,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:01:38,603 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:01:38,607 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:01:38,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:01:38 BoogieIcfgContainer [2025-03-16 15:01:38,607 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:01:38,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:01:38,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:01:38,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:01:38,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:01:32" (1/3) ... [2025-03-16 15:01:38,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405b643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:01:38, skipping insertion in model container [2025-03-16 15:01:38,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:01:33" (2/3) ... [2025-03-16 15:01:38,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405b643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:01:38, skipping insertion in model container [2025-03-16 15:01:38,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:01:38" (3/3) ... [2025-03-16 15:01:38,617 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label27.c [2025-03-16 15:01:38,629 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:01:38,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label27.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:01:38,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:01:38,703 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;@4bcf5757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:01:38,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:01:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 15:01:38,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:38,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:38,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 745844914, now seen corresponding path program 1 times [2025-03-16 15:01:38,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:38,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400351804] [2025-03-16 15:01:38,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:38,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 15:01:38,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 15:01:38,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:38,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:01:38,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400351804] [2025-03-16 15:01:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400351804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:38,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:38,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:01:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439596468] [2025-03-16 15:01:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:38,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:01:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:38,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:01:38,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:01:38,864 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:38,933 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:01:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:01:38,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 15:01:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:38,949 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:01:38,952 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:01:38,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:01:38,962 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:38,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:01:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:01:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:01:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:01:39,042 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 44 [2025-03-16 15:01:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:39,043 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:01:39,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:01:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 15:01:39,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:39,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:39,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:01:39,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:39,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash -824840685, now seen corresponding path program 1 times [2025-03-16 15:01:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:39,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917308023] [2025-03-16 15:01:39,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:39,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 15:01:39,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 15:01:39,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:39,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:01:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917308023] [2025-03-16 15:01:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917308023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:39,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:39,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:01:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659438377] [2025-03-16 15:01:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:39,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:39,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:39,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:39,259 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:42,421 INFO L93 Difference]: Finished difference Result 2931 states and 5350 transitions. [2025-03-16 15:01:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:42,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 15:01:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:42,430 INFO L225 Difference]: With dead ends: 2931 [2025-03-16 15:01:42,431 INFO L226 Difference]: Without dead ends: 1898 [2025-03-16 15:01:42,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:42,433 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 970 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 3434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:42,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 600 Invalid, 3434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 15:01:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-03-16 15:01:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2025-03-16 15:01:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.73784355179704) internal successors, (3288), 1892 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3288 transitions. [2025-03-16 15:01:42,470 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3288 transitions. Word has length 44 [2025-03-16 15:01:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:42,471 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3288 transitions. [2025-03-16 15:01:42,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3288 transitions. [2025-03-16 15:01:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 15:01:42,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:42,474 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:42,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:01:42,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:42,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash 688040354, now seen corresponding path program 1 times [2025-03-16 15:01:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:42,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492092933] [2025-03-16 15:01:42,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:42,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 15:01:42,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 15:01:42,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:42,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:01:42,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:42,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492092933] [2025-03-16 15:01:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492092933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:42,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:01:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437027239] [2025-03-16 15:01:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:42,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:42,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:42,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:42,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:42,755 INFO L87 Difference]: Start difference. First operand 1893 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:45,693 INFO L93 Difference]: Finished difference Result 5436 states and 9565 transitions. [2025-03-16 15:01:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:45,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 15:01:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:45,707 INFO L225 Difference]: With dead ends: 5436 [2025-03-16 15:01:45,707 INFO L226 Difference]: Without dead ends: 3544 [2025-03-16 15:01:45,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:45,711 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:45,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 880 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 15:01:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2025-03-16 15:01:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3483. [2025-03-16 15:01:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3483 states, 3482 states have (on average 1.586731763354394) internal successors, (5525), 3482 states have internal predecessors, (5525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 5525 transitions. [2025-03-16 15:01:45,773 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 5525 transitions. Word has length 109 [2025-03-16 15:01:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:45,773 INFO L471 AbstractCegarLoop]: Abstraction has 3483 states and 5525 transitions. [2025-03-16 15:01:45,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 5525 transitions. [2025-03-16 15:01:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 15:01:45,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:45,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:45,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:01:45,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:45,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash 46436076, now seen corresponding path program 1 times [2025-03-16 15:01:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:45,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529080274] [2025-03-16 15:01:45,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:45,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 15:01:45,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 15:01:45,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:45,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:01:45,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529080274] [2025-03-16 15:01:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529080274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:45,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:01:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112324358] [2025-03-16 15:01:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:45,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:45,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:45,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:45,926 INFO L87 Difference]: Start difference. First operand 3483 states and 5525 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:48,310 INFO L93 Difference]: Finished difference Result 10137 states and 16133 transitions. [2025-03-16 15:01:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:48,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-16 15:01:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:48,332 INFO L225 Difference]: With dead ends: 10137 [2025-03-16 15:01:48,332 INFO L226 Difference]: Without dead ends: 6655 [2025-03-16 15:01:48,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:48,340 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:48,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1135 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:01:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6655 states. [2025-03-16 15:01:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6655 to 6654. [2025-03-16 15:01:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6654 states, 6653 states have (on average 1.4172553735157072) internal successors, (9429), 6653 states have internal predecessors, (9429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6654 states to 6654 states and 9429 transitions. [2025-03-16 15:01:48,435 INFO L78 Accepts]: Start accepts. Automaton has 6654 states and 9429 transitions. Word has length 110 [2025-03-16 15:01:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:48,436 INFO L471 AbstractCegarLoop]: Abstraction has 6654 states and 9429 transitions. [2025-03-16 15:01:48,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6654 states and 9429 transitions. [2025-03-16 15:01:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 15:01:48,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:48,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:48,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:01:48,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:48,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash -98764692, now seen corresponding path program 1 times [2025-03-16 15:01:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201767991] [2025-03-16 15:01:48,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:48,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 15:01:48,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 15:01:48,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:48,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:01:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:48,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201767991] [2025-03-16 15:01:48,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201767991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:48,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:01:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542836738] [2025-03-16 15:01:48,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:48,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:48,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:48,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:48,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:48,604 INFO L87 Difference]: Start difference. First operand 6654 states and 9429 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:51,886 INFO L93 Difference]: Finished difference Result 14119 states and 20672 transitions. [2025-03-16 15:01:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:51,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-16 15:01:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:51,901 INFO L225 Difference]: With dead ends: 14119 [2025-03-16 15:01:51,901 INFO L226 Difference]: Without dead ends: 7466 [2025-03-16 15:01:51,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:51,907 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:51,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1175 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-16 15:01:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2025-03-16 15:01:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7455. [2025-03-16 15:01:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 1.3390126106788303) internal successors, (9981), 7454 states have internal predecessors, (9981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9981 transitions. [2025-03-16 15:01:51,990 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9981 transitions. Word has length 113 [2025-03-16 15:01:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:51,991 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 9981 transitions. [2025-03-16 15:01:51,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9981 transitions. [2025-03-16 15:01:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 15:01:51,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:51,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:51,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:01:51,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1534953379, now seen corresponding path program 1 times [2025-03-16 15:01:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596178824] [2025-03-16 15:01:51,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:52,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 15:01:52,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 15:01:52,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:52,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:01:52,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:52,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596178824] [2025-03-16 15:01:52,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596178824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:52,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:52,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:01:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729212450] [2025-03-16 15:01:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:52,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:52,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:52,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:52,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:52,246 INFO L87 Difference]: Start difference. First operand 7455 states and 9981 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:54,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:54,353 INFO L93 Difference]: Finished difference Result 14122 states and 19149 transitions. [2025-03-16 15:01:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:54,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-16 15:01:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:54,369 INFO L225 Difference]: With dead ends: 14122 [2025-03-16 15:01:54,369 INFO L226 Difference]: Without dead ends: 7455 [2025-03-16 15:01:54,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:54,374 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:54,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1214 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:01:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2025-03-16 15:01:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2025-03-16 15:01:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 1.3363294875234772) internal successors, (9961), 7454 states have internal predecessors, (9961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9961 transitions. [2025-03-16 15:01:54,461 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9961 transitions. Word has length 155 [2025-03-16 15:01:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:54,463 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 9961 transitions. [2025-03-16 15:01:54,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9961 transitions. [2025-03-16 15:01:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 15:01:54,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:54,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:54,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:01:54,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:54,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash -671123513, now seen corresponding path program 1 times [2025-03-16 15:01:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014711508] [2025-03-16 15:01:54,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 15:01:54,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 15:01:54,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:54,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:01:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014711508] [2025-03-16 15:01:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014711508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:54,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:54,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593931683] [2025-03-16 15:01:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:54,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:54,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:54,550 INFO L87 Difference]: Start difference. First operand 7455 states and 9961 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:57,218 INFO L93 Difference]: Finished difference Result 20415 states and 27797 transitions. [2025-03-16 15:01:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:57,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-16 15:01:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:57,238 INFO L225 Difference]: With dead ends: 20415 [2025-03-16 15:01:57,238 INFO L226 Difference]: Without dead ends: 13748 [2025-03-16 15:01:57,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:57,245 INFO L435 NwaCegarLoop]: 1866 mSDtfsCounter, 889 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:57,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 2005 Invalid, 3292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:01:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13748 states. [2025-03-16 15:01:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13748 to 13743. [2025-03-16 15:01:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13743 states, 13742 states have (on average 1.2573133459467327) internal successors, (17278), 13742 states have internal predecessors, (17278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13743 states to 13743 states and 17278 transitions. [2025-03-16 15:01:57,425 INFO L78 Accepts]: Start accepts. Automaton has 13743 states and 17278 transitions. Word has length 169 [2025-03-16 15:01:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:57,426 INFO L471 AbstractCegarLoop]: Abstraction has 13743 states and 17278 transitions. [2025-03-16 15:01:57,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 13743 states and 17278 transitions. [2025-03-16 15:01:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 15:01:57,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:57,429 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:01:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:01:57,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:57,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1773870418, now seen corresponding path program 1 times [2025-03-16 15:01:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818743763] [2025-03-16 15:01:57,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:57,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 15:01:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 15:01:57,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:01:57,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:57,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818743763] [2025-03-16 15:01:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818743763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:57,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705705004] [2025-03-16 15:01:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:57,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:57,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:57,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:57,617 INFO L87 Difference]: Start difference. First operand 13743 states and 17278 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:00,359 INFO L93 Difference]: Finished difference Result 37743 states and 48082 transitions. [2025-03-16 15:02:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:00,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-03-16 15:02:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:00,390 INFO L225 Difference]: With dead ends: 37743 [2025-03-16 15:02:00,390 INFO L226 Difference]: Without dead ends: 23210 [2025-03-16 15:02:00,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:00,402 INFO L435 NwaCegarLoop]: 1818 mSDtfsCounter, 753 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 3297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:00,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1958 Invalid, 3297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:02:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23210 states. [2025-03-16 15:02:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23210 to 22398. [2025-03-16 15:02:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22398 states, 22397 states have (on average 1.1936420056257535) internal successors, (26734), 22397 states have internal predecessors, (26734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22398 states to 22398 states and 26734 transitions. [2025-03-16 15:02:00,685 INFO L78 Accepts]: Start accepts. Automaton has 22398 states and 26734 transitions. Word has length 256 [2025-03-16 15:02:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:00,687 INFO L471 AbstractCegarLoop]: Abstraction has 22398 states and 26734 transitions. [2025-03-16 15:02:00,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22398 states and 26734 transitions. [2025-03-16 15:02:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-16 15:02:00,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:00,693 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:02:00,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:00,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash 938293770, now seen corresponding path program 1 times [2025-03-16 15:02:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:00,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937004983] [2025-03-16 15:02:00,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:00,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-16 15:02:00,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-16 15:02:00,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:00,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 15:02:00,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937004983] [2025-03-16 15:02:00,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937004983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:00,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:00,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698231024] [2025-03-16 15:02:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:00,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:00,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:00,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:00,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:00,956 INFO L87 Difference]: Start difference. First operand 22398 states and 26734 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:06,114 INFO L93 Difference]: Finished difference Result 80428 states and 97054 transitions. [2025-03-16 15:02:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:06,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 310 [2025-03-16 15:02:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:06,192 INFO L225 Difference]: With dead ends: 80428 [2025-03-16 15:02:06,193 INFO L226 Difference]: Without dead ends: 58818 [2025-03-16 15:02:06,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:06,215 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 1690 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 6960 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 7896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 6960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:06,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 1273 Invalid, 7896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [936 Valid, 6960 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 15:02:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58818 states. [2025-03-16 15:02:06,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58818 to 57114. [2025-03-16 15:02:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57114 states, 57113 states have (on average 1.1769474550452612) internal successors, (67219), 57113 states have internal predecessors, (67219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57114 states to 57114 states and 67219 transitions. [2025-03-16 15:02:06,831 INFO L78 Accepts]: Start accepts. Automaton has 57114 states and 67219 transitions. Word has length 310 [2025-03-16 15:02:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:06,832 INFO L471 AbstractCegarLoop]: Abstraction has 57114 states and 67219 transitions. [2025-03-16 15:02:06,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 57114 states and 67219 transitions. [2025-03-16 15:02:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-16 15:02:06,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:06,837 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:02:06,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:02:06,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:06,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1799255355, now seen corresponding path program 1 times [2025-03-16 15:02:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160039245] [2025-03-16 15:02:06,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:06,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:06,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 15:02:06,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 15:02:06,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:06,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 214 proven. 113 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 15:02:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160039245] [2025-03-16 15:02:08,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160039245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:02:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512417239] [2025-03-16 15:02:08,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:08,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:02:08,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:02:08,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:02:08,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:02:08,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 15:02:08,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 15:02:08,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:08,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:08,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:02:08,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:02:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 15:02:08,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:02:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512417239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:08,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:02:08,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:02:08,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103346753] [2025-03-16 15:02:08,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:08,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:08,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:08,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:02:08,432 INFO L87 Difference]: Start difference. First operand 57114 states and 67219 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:10,926 INFO L93 Difference]: Finished difference Result 113429 states and 133635 transitions. [2025-03-16 15:02:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 350 [2025-03-16 15:02:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:11,000 INFO L225 Difference]: With dead ends: 113429 [2025-03-16 15:02:11,000 INFO L226 Difference]: Without dead ends: 57103 [2025-03-16 15:02:11,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:02:11,036 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 1076 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:11,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 804 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:02:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57103 states. [2025-03-16 15:02:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57103 to 57100. [2025-03-16 15:02:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57100 states, 57099 states have (on average 1.1291791449937827) internal successors, (64475), 57099 states have internal predecessors, (64475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57100 states to 57100 states and 64475 transitions. [2025-03-16 15:02:11,692 INFO L78 Accepts]: Start accepts. Automaton has 57100 states and 64475 transitions. Word has length 350 [2025-03-16 15:02:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:11,693 INFO L471 AbstractCegarLoop]: Abstraction has 57100 states and 64475 transitions. [2025-03-16 15:02:11,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 57100 states and 64475 transitions. [2025-03-16 15:02:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-16 15:02:11,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:11,697 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:11,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:02:11,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 15:02:11,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash 210860128, now seen corresponding path program 1 times [2025-03-16 15:02:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515488235] [2025-03-16 15:02:11,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:11,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 15:02:11,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 15:02:11,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:11,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 221 proven. 110 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 15:02:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515488235] [2025-03-16 15:02:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515488235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:02:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169577150] [2025-03-16 15:02:12,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:12,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:02:12,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:02:12,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:02:12,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:02:12,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 15:02:12,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 15:02:12,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:12,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:12,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:02:12,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:02:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 15:02:12,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:02:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169577150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:02:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:02:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695311011] [2025-03-16 15:02:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:12,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:12,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:12,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:02:12,864 INFO L87 Difference]: Start difference. First operand 57100 states and 64475 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:15,346 INFO L93 Difference]: Finished difference Result 113410 states and 128156 transitions. [2025-03-16 15:02:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:15,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 352 [2025-03-16 15:02:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:15,477 INFO L225 Difference]: With dead ends: 113410 [2025-03-16 15:02:15,478 INFO L226 Difference]: Without dead ends: 57098 [2025-03-16 15:02:15,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:02:15,498 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 1132 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:15,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1424 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:02:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57098 states. [2025-03-16 15:02:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57098 to 57097. [2025-03-16 15:02:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57097 states, 57096 states have (on average 1.0980103685021718) internal successors, (62692), 57096 states have internal predecessors, (62692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57097 states to 57097 states and 62692 transitions. [2025-03-16 15:02:16,070 INFO L78 Accepts]: Start accepts. Automaton has 57097 states and 62692 transitions. Word has length 352 [2025-03-16 15:02:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 57097 states and 62692 transitions. [2025-03-16 15:02:16,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 57097 states and 62692 transitions. [2025-03-16 15:02:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-03-16 15:02:16,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:16,078 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:16,084 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-16 15:02:16,278 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,SelfDestructingSolverStorable10 [2025-03-16 15:02:16,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:16,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1811518195, now seen corresponding path program 1 times [2025-03-16 15:02:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:16,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66415336] [2025-03-16 15:02:16,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:16,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-16 15:02:16,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-16 15:02:16,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:16,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 310 proven. 113 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 15:02:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66415336] [2025-03-16 15:02:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66415336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:02:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494378519] [2025-03-16 15:02:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:17,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:02:17,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:02:17,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:02:17,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:02:17,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-16 15:02:17,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-16 15:02:17,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:17,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:17,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:02:17,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:02:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-16 15:02:17,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:02:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494378519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:17,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:02:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:02:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313231944] [2025-03-16 15:02:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:17,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:17,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:17,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:02:17,395 INFO L87 Difference]: Start difference. First operand 57097 states and 62692 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:20,238 INFO L93 Difference]: Finished difference Result 137037 states and 151846 transitions. [2025-03-16 15:02:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:20,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 400 [2025-03-16 15:02:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:20,321 INFO L225 Difference]: With dead ends: 137037 [2025-03-16 15:02:20,321 INFO L226 Difference]: Without dead ends: 80728 [2025-03-16 15:02:20,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:02:20,343 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 823 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:20,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1112 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:02:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80728 states. [2025-03-16 15:02:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80728 to 79131. [2025-03-16 15:02:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79131 states, 79130 states have (on average 1.0810185770251486) internal successors, (85541), 79130 states have internal predecessors, (85541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79131 states to 79131 states and 85541 transitions. [2025-03-16 15:02:20,952 INFO L78 Accepts]: Start accepts. Automaton has 79131 states and 85541 transitions. Word has length 400 [2025-03-16 15:02:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:20,953 INFO L471 AbstractCegarLoop]: Abstraction has 79131 states and 85541 transitions. [2025-03-16 15:02:20,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 79131 states and 85541 transitions. [2025-03-16 15:02:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-16 15:02:20,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:20,958 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:20,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:02:21,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:02:21,158 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:21,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1437126911, now seen corresponding path program 1 times [2025-03-16 15:02:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297667312] [2025-03-16 15:02:21,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:21,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-16 15:02:21,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-16 15:02:21,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:21,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 383 proven. 113 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 15:02:22,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:22,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297667312] [2025-03-16 15:02:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297667312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:02:22,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210209815] [2025-03-16 15:02:22,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:22,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:02:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:02:22,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:02:22,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:02:22,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-16 15:02:22,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-16 15:02:22,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:22,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:22,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:02:22,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:02:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 15:02:22,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:02:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210209815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:22,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:02:22,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-03-16 15:02:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684415393] [2025-03-16 15:02:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:22,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:22,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:22,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:02:22,639 INFO L87 Difference]: Start difference. First operand 79131 states and 85541 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:24,740 INFO L93 Difference]: Finished difference Result 153543 states and 166151 transitions. [2025-03-16 15:02:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:24,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2025-03-16 15:02:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:24,819 INFO L225 Difference]: With dead ends: 153543 [2025-03-16 15:02:24,819 INFO L226 Difference]: Without dead ends: 83076 [2025-03-16 15:02:24,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:02:24,861 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 684 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 2570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:24,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1161 Invalid, 2570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:02:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83076 states. [2025-03-16 15:02:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83076 to 81492. [2025-03-16 15:02:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81492 states, 81491 states have (on average 1.0727810433053957) internal successors, (87422), 81491 states have internal predecessors, (87422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81492 states to 81492 states and 87422 transitions. [2025-03-16 15:02:25,777 INFO L78 Accepts]: Start accepts. Automaton has 81492 states and 87422 transitions. Word has length 435 [2025-03-16 15:02:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:25,777 INFO L471 AbstractCegarLoop]: Abstraction has 81492 states and 87422 transitions. [2025-03-16 15:02:25,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 81492 states and 87422 transitions. [2025-03-16 15:02:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-16 15:02:25,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:25,784 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:25,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:02:25,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:02:25,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:25,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:25,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1165443157, now seen corresponding path program 1 times [2025-03-16 15:02:25,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:25,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226799181] [2025-03-16 15:02:25,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:26,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-16 15:02:26,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-16 15:02:26,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:26,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-16 15:02:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226799181] [2025-03-16 15:02:26,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226799181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:26,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:26,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465288654] [2025-03-16 15:02:26,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:26,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:26,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:26,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:26,126 INFO L87 Difference]: Start difference. First operand 81492 states and 87422 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:28,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:28,765 INFO L93 Difference]: Finished difference Result 161407 states and 173191 transitions. [2025-03-16 15:02:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 481 [2025-03-16 15:02:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:28,847 INFO L225 Difference]: With dead ends: 161407 [2025-03-16 15:02:28,847 INFO L226 Difference]: Without dead ends: 80703 [2025-03-16 15:02:28,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:28,894 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 939 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:28,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1427 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:02:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80703 states. [2025-03-16 15:02:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80703 to 79905. [2025-03-16 15:02:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79905 states, 79904 states have (on average 1.0588456147376852) internal successors, (84606), 79904 states have internal predecessors, (84606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79905 states to 79905 states and 84606 transitions. [2025-03-16 15:02:29,627 INFO L78 Accepts]: Start accepts. Automaton has 79905 states and 84606 transitions. Word has length 481 [2025-03-16 15:02:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:29,627 INFO L471 AbstractCegarLoop]: Abstraction has 79905 states and 84606 transitions. [2025-03-16 15:02:29,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 79905 states and 84606 transitions. [2025-03-16 15:02:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-16 15:02:29,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:29,635 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:29,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:02:29,635 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:29,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:29,635 INFO L85 PathProgramCache]: Analyzing trace with hash -916788527, now seen corresponding path program 1 times [2025-03-16 15:02:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:29,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112835620] [2025-03-16 15:02:29,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:29,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-16 15:02:29,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-16 15:02:29,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 760 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-16 15:02:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:30,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112835620] [2025-03-16 15:02:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112835620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:30,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:30,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052241543] [2025-03-16 15:02:30,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:30,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:30,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:30,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:30,004 INFO L87 Difference]: Start difference. First operand 79905 states and 84606 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:32,447 INFO L93 Difference]: Finished difference Result 185008 states and 196918 transitions. [2025-03-16 15:02:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 495 [2025-03-16 15:02:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:32,554 INFO L225 Difference]: With dead ends: 185008 [2025-03-16 15:02:32,555 INFO L226 Difference]: Without dead ends: 104312 [2025-03-16 15:02:32,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:32,579 INFO L435 NwaCegarLoop]: 1701 mSDtfsCounter, 763 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:32,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1838 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:02:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104312 states. [2025-03-16 15:02:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104312 to 102712. [2025-03-16 15:02:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102712 states, 102711 states have (on average 1.0534704169952585) internal successors, (108203), 102711 states have internal predecessors, (108203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102712 states to 102712 states and 108203 transitions. [2025-03-16 15:02:33,634 INFO L78 Accepts]: Start accepts. Automaton has 102712 states and 108203 transitions. Word has length 495 [2025-03-16 15:02:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:33,635 INFO L471 AbstractCegarLoop]: Abstraction has 102712 states and 108203 transitions. [2025-03-16 15:02:33,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 102712 states and 108203 transitions. [2025-03-16 15:02:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-16 15:02:33,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:33,643 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:33,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:02:33,644 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:33,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1459659709, now seen corresponding path program 1 times [2025-03-16 15:02:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:33,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864499934] [2025-03-16 15:02:33,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:33,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:33,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-16 15:02:33,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-16 15:02:33,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:33,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-16 15:02:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864499934] [2025-03-16 15:02:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864499934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:33,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:33,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:33,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58614270] [2025-03-16 15:02:33,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:33,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:33,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:33,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:33,919 INFO L87 Difference]: Start difference. First operand 102712 states and 108203 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:36,113 INFO L93 Difference]: Finished difference Result 192831 states and 203520 transitions. [2025-03-16 15:02:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 497 [2025-03-16 15:02:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:36,239 INFO L225 Difference]: With dead ends: 192831 [2025-03-16 15:02:36,239 INFO L226 Difference]: Without dead ends: 103505 [2025-03-16 15:02:36,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:36,301 INFO L435 NwaCegarLoop]: 1732 mSDtfsCounter, 722 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:36,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1863 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:02:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103505 states. [2025-03-16 15:02:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103505 to 103500. [2025-03-16 15:02:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103500 states, 103499 states have (on average 1.053401482139924) internal successors, (109026), 103499 states have internal predecessors, (109026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103500 states to 103500 states and 109026 transitions. [2025-03-16 15:02:37,372 INFO L78 Accepts]: Start accepts. Automaton has 103500 states and 109026 transitions. Word has length 497 [2025-03-16 15:02:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:37,373 INFO L471 AbstractCegarLoop]: Abstraction has 103500 states and 109026 transitions. [2025-03-16 15:02:37,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 103500 states and 109026 transitions. [2025-03-16 15:02:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-16 15:02:37,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:37,380 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:37,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:02:37,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:37,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1849717031, now seen corresponding path program 1 times [2025-03-16 15:02:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:37,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487619039] [2025-03-16 15:02:37,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:37,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-16 15:02:37,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-16 15:02:37,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:37,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-16 15:02:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487619039] [2025-03-16 15:02:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487619039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:37,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392479743] [2025-03-16 15:02:37,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:37,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:37,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:37,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:37,534 INFO L87 Difference]: Start difference. First operand 103500 states and 109026 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:39,060 INFO L93 Difference]: Finished difference Result 192812 states and 203490 transitions. [2025-03-16 15:02:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:39,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 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 522 [2025-03-16 15:02:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:39,188 INFO L225 Difference]: With dead ends: 192812 [2025-03-16 15:02:39,188 INFO L226 Difference]: Without dead ends: 102698 [2025-03-16 15:02:39,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:39,241 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1596 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:39,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 289 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:02:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102698 states. [2025-03-16 15:02:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102698 to 102697. [2025-03-16 15:02:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102697 states, 102696 states have (on average 1.0533126898808132) internal successors, (108171), 102696 states have internal predecessors, (108171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102697 states to 102697 states and 108171 transitions. [2025-03-16 15:02:40,897 INFO L78 Accepts]: Start accepts. Automaton has 102697 states and 108171 transitions. Word has length 522 [2025-03-16 15:02:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:40,897 INFO L471 AbstractCegarLoop]: Abstraction has 102697 states and 108171 transitions. [2025-03-16 15:02:40,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 102697 states and 108171 transitions. [2025-03-16 15:02:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-03-16 15:02:40,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:40,904 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:02:40,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:02:40,904 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:40,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1158425084, now seen corresponding path program 1 times [2025-03-16 15:02:40,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:40,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369068424] [2025-03-16 15:02:40,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:40,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-16 15:02:40,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-16 15:02:40,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:40,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:02:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369068424] [2025-03-16 15:02:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369068424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421755226] [2025-03-16 15:02:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:41,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:41,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:41,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:41,131 INFO L87 Difference]: Start difference. First operand 102697 states and 108171 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:43,661 INFO L93 Difference]: Finished difference Result 230595 states and 244011 transitions. [2025-03-16 15:02:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:43,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 524 [2025-03-16 15:02:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:43,809 INFO L225 Difference]: With dead ends: 230595 [2025-03-16 15:02:43,809 INFO L226 Difference]: Without dead ends: 127112 [2025-03-16 15:02:43,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:43,881 INFO L435 NwaCegarLoop]: 1682 mSDtfsCounter, 692 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:43,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1817 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:02:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127112 states. [2025-03-16 15:02:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127112 to 125520. [2025-03-16 15:02:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125520 states, 125519 states have (on average 1.0488850293581051) internal successors, (131655), 125519 states have internal predecessors, (131655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125520 states to 125520 states and 131655 transitions. [2025-03-16 15:02:45,295 INFO L78 Accepts]: Start accepts. Automaton has 125520 states and 131655 transitions. Word has length 524 [2025-03-16 15:02:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:45,295 INFO L471 AbstractCegarLoop]: Abstraction has 125520 states and 131655 transitions. [2025-03-16 15:02:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 125520 states and 131655 transitions. [2025-03-16 15:02:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-16 15:02:45,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:45,304 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 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] [2025-03-16 15:02:45,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:02:45,304 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:45,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash -144864731, now seen corresponding path program 1 times [2025-03-16 15:02:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:45,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738156401] [2025-03-16 15:02:45,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:45,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-16 15:02:45,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-16 15:02:45,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:45,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-16 15:02:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738156401] [2025-03-16 15:02:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738156401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:45,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:45,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721457114] [2025-03-16 15:02:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:45,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:45,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:45,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:45,963 INFO L87 Difference]: Start difference. First operand 125520 states and 131655 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:49,049 INFO L93 Difference]: Finished difference Result 250258 states and 262523 transitions. [2025-03-16 15:02:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:49,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 527 [2025-03-16 15:02:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:49,183 INFO L225 Difference]: With dead ends: 250258 [2025-03-16 15:02:49,183 INFO L226 Difference]: Without dead ends: 125526 [2025-03-16 15:02:49,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:49,236 INFO L435 NwaCegarLoop]: 1625 mSDtfsCounter, 815 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:49,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1754 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:02:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125526 states. [2025-03-16 15:02:50,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125526 to 123942. [2025-03-16 15:02:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123942 states, 123941 states have (on average 1.0375581930111908) internal successors, (128596), 123941 states have internal predecessors, (128596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123942 states to 123942 states and 128596 transitions. [2025-03-16 15:02:50,571 INFO L78 Accepts]: Start accepts. Automaton has 123942 states and 128596 transitions. Word has length 527 [2025-03-16 15:02:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:50,571 INFO L471 AbstractCegarLoop]: Abstraction has 123942 states and 128596 transitions. [2025-03-16 15:02:50,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 123942 states and 128596 transitions. [2025-03-16 15:02:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-16 15:02:50,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:50,578 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:50,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:02:50,579 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:50,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:50,579 INFO L85 PathProgramCache]: Analyzing trace with hash -621561348, now seen corresponding path program 1 times [2025-03-16 15:02:50,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:50,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334874688] [2025-03-16 15:02:50,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:50,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-16 15:02:50,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-16 15:02:50,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:50,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-03-16 15:02:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334874688] [2025-03-16 15:02:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334874688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156334941] [2025-03-16 15:02:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:50,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:50,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:50,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:50,843 INFO L87 Difference]: Start difference. First operand 123942 states and 128596 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)