./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_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 dc961fc62f24960fbef105f97d1eee66be6194c126d8d078cb5da412dc4c48ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:50:48,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:50:48,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:50:48,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:50:48,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:50:48,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:50:48,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:50:48,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:50:48,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:50:48,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:50:48,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:50:48,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:50:48,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:50:48,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:50:48,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:50:48,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:50:48,889 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:50:48,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:50:48,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:50:48,889 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 -> dc961fc62f24960fbef105f97d1eee66be6194c126d8d078cb5da412dc4c48ac [2025-03-03 10:50:49,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:50:49,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:50:49,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:50:49,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:50:49,104 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:50:49,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label27.c [2025-03-03 10:50:50,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2769a85f4/ddf831e964ec4adaaa47b9a4a7ba7d99/FLAGa9f852b45 [2025-03-03 10:50:50,542 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:50:50,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label27.c [2025-03-03 10:50:50,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2769a85f4/ddf831e964ec4adaaa47b9a4a7ba7d99/FLAGa9f852b45 [2025-03-03 10:50:50,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2769a85f4/ddf831e964ec4adaaa47b9a4a7ba7d99 [2025-03-03 10:50:50,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:50:50,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:50:50,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:50:50,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:50:50,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:50:50,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c994cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:50, skipping insertion in model container [2025-03-03 10:50:50,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:50:50" (1/1) ... [2025-03-03 10:50:50,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:50:50,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label27.c[4605,4618] [2025-03-03 10:50:51,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:50:51,081 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:50:51,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label27.c[4605,4618] [2025-03-03 10:50:51,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:50:51,248 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:50:51,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51 WrapperNode [2025-03-03 10:50:51,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:50:51,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:50:51,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:50:51,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:50:51,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,410 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-03 10:50:51,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:50:51,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:50:51,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:50:51,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:50:51,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,537 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:50:51,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,578 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:50:51,647 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:50:51,647 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:50:51,647 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:50:51,648 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (1/1) ... [2025-03-03 10:50:51,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:50:51,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:51,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:50:51,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:50:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:50:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:50:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:50:51,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:50:51,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:50:51,740 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:50:53,508 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-03 10:50:53,585 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-03 10:50:53,586 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:50:53,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:50:53,623 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:50:53,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:53 BoogieIcfgContainer [2025-03-03 10:50:53,623 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:50:53,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:50:53,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:50:53,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:50:53,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:50:50" (1/3) ... [2025-03-03 10:50:53,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4298d0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:50:53, skipping insertion in model container [2025-03-03 10:50:53,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:51" (2/3) ... [2025-03-03 10:50:53,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4298d0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:50:53, skipping insertion in model container [2025-03-03 10:50:53,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:53" (3/3) ... [2025-03-03 10:50:53,631 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label27.c [2025-03-03 10:50:53,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:50:53,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label27.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:50:53,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:50:53,700 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;@7db9e20b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:50:53,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:50:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 10:50:53,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:53,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:53,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:53,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1624342089, now seen corresponding path program 1 times [2025-03-03 10:50:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:53,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636243958] [2025-03-03 10:50:53,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:53,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 10:50:53,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 10:50:53,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:53,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:50:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636243958] [2025-03-03 10:50:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636243958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:53,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:53,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:50:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720838186] [2025-03-03 10:50:53,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:53,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:53,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:53,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:53,986 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:55,354 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-03-03 10:50:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:55,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 10:50:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:55,365 INFO L225 Difference]: With dead ends: 1154 [2025-03-03 10:50:55,366 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 10:50:55,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:55,370 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 284 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:55,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 385 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:50:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 10:50:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-03-03 10:50:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-03-03 10:50:55,411 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 37 [2025-03-03 10:50:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:55,411 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-03-03 10:50:55,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-03-03 10:50:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 10:50:55,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:55,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:55,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:50:55,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:55,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash -308367802, now seen corresponding path program 1 times [2025-03-03 10:50:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138990198] [2025-03-03 10:50:55,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:55,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 10:50:55,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 10:50:55,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:55,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:50:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138990198] [2025-03-03 10:50:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138990198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:55,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:50:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330825171] [2025-03-03 10:50:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:55,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:55,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:55,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:55,789 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:56,783 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-03-03 10:50:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:56,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-03 10:50:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:56,787 INFO L225 Difference]: With dead ends: 1624 [2025-03-03 10:50:56,787 INFO L226 Difference]: Without dead ends: 963 [2025-03-03 10:50:56,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:56,789 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:56,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:50:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-03 10:50:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-03-03 10:50:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-03-03 10:50:56,818 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 102 [2025-03-03 10:50:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:56,819 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-03-03 10:50:56,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-03-03 10:50:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 10:50:56,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:56,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:56,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:50:56,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:56,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:56,826 INFO L85 PathProgramCache]: Analyzing trace with hash 752366255, now seen corresponding path program 1 times [2025-03-03 10:50:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:56,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793051346] [2025-03-03 10:50:56,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:56,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 10:50:56,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 10:50:56,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:56,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:50:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:57,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793051346] [2025-03-03 10:50:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793051346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:57,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452559591] [2025-03-03 10:50:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:57,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:50:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:57,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:50:57,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:57,099 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:58,522 INFO L93 Difference]: Finished difference Result 2240 states and 3197 transitions. [2025-03-03 10:50:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:58,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-03 10:50:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:58,532 INFO L225 Difference]: With dead ends: 2240 [2025-03-03 10:50:58,532 INFO L226 Difference]: Without dead ends: 1578 [2025-03-03 10:50:58,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:58,534 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 933 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:58,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 327 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:50:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-03 10:50:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1266. [2025-03-03 10:50:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-03-03 10:50:58,558 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 107 [2025-03-03 10:50:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:58,559 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-03-03 10:50:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-03-03 10:50:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 10:50:58,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:58,562 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:58,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:50:58,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:58,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1724369820, now seen corresponding path program 1 times [2025-03-03 10:50:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042274558] [2025-03-03 10:50:58,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:58,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 10:50:58,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 10:50:58,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:58,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:50:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:58,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042274558] [2025-03-03 10:50:58,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042274558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:58,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:58,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995904888] [2025-03-03 10:50:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:58,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:58,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:58,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:58,775 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:00,750 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2025-03-03 10:51:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:00,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-03-03 10:51:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:00,762 INFO L225 Difference]: With dead ends: 4670 [2025-03-03 10:51:00,762 INFO L226 Difference]: Without dead ends: 3406 [2025-03-03 10:51:00,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:00,764 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 487 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:00,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 375 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:51:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-03-03 10:51:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2025-03-03 10:51:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.23698224852071) internal successors, (4181), 3380 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4181 transitions. [2025-03-03 10:51:00,810 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4181 transitions. Word has length 203 [2025-03-03 10:51:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:00,811 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4181 transitions. [2025-03-03 10:51:00,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4181 transitions. [2025-03-03 10:51:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 10:51:00,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:00,816 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:51:00,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:51:00,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:00,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash 404761574, now seen corresponding path program 1 times [2025-03-03 10:51:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:00,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724986620] [2025-03-03 10:51:00,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:00,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 10:51:00,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 10:51:00,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:00,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:51:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:00,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724986620] [2025-03-03 10:51:00,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724986620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:00,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:00,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:51:00,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214446086] [2025-03-03 10:51:00,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:00,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:00,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:00,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:00,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:00,998 INFO L87 Difference]: Start difference. First operand 3381 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:02,073 INFO L93 Difference]: Finished difference Result 8563 states and 10756 transitions. [2025-03-03 10:51:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:02,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 207 [2025-03-03 10:51:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:02,090 INFO L225 Difference]: With dead ends: 8563 [2025-03-03 10:51:02,091 INFO L226 Difference]: Without dead ends: 5483 [2025-03-03 10:51:02,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:02,095 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:02,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 340 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:51:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-03-03 10:51:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-03-03 10:51:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.168888077414643) internal successors, (6402), 5477 states have internal predecessors, (6402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6402 transitions. [2025-03-03 10:51:02,185 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6402 transitions. Word has length 207 [2025-03-03 10:51:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:02,186 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6402 transitions. [2025-03-03 10:51:02,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6402 transitions. [2025-03-03 10:51:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 10:51:02,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:02,189 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:02,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:51:02,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:02,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:02,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1500520408, now seen corresponding path program 1 times [2025-03-03 10:51:02,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:02,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927339458] [2025-03-03 10:51:02,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:02,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 10:51:02,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 10:51:02,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:02,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 10:51:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927339458] [2025-03-03 10:51:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927339458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:51:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755410287] [2025-03-03 10:51:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:02,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:02,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:02,649 INFO L87 Difference]: Start difference. First operand 5478 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:03,597 INFO L93 Difference]: Finished difference Result 10655 states and 12491 transitions. [2025-03-03 10:51:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2025-03-03 10:51:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:03,609 INFO L225 Difference]: With dead ends: 10655 [2025-03-03 10:51:03,609 INFO L226 Difference]: Without dead ends: 5478 [2025-03-03 10:51:03,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:03,614 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:03,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:51:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-03-03 10:51:03,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-03-03 10:51:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1677925871827644) internal successors, (6396), 5477 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6396 transitions. [2025-03-03 10:51:03,680 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6396 transitions. Word has length 309 [2025-03-03 10:51:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6396 transitions. [2025-03-03 10:51:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6396 transitions. [2025-03-03 10:51:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 10:51:03,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:03,683 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:03,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:51:03,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1511993785, now seen corresponding path program 1 times [2025-03-03 10:51:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8106643] [2025-03-03 10:51:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:03,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 10:51:03,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 10:51:03,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:03,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:51:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8106643] [2025-03-03 10:51:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8106643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:03,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340555663] [2025-03-03 10:51:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:03,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:03,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:03,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:03,870 INFO L87 Difference]: Start difference. First operand 5478 states and 6396 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:04,992 INFO L93 Difference]: Finished difference Result 11851 states and 14153 transitions. [2025-03-03 10:51:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-03-03 10:51:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:05,008 INFO L225 Difference]: With dead ends: 11851 [2025-03-03 10:51:05,008 INFO L226 Difference]: Without dead ends: 6674 [2025-03-03 10:51:05,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:05,013 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 278 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:05,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 324 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:51:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-03-03 10:51:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 5175. [2025-03-03 10:51:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 5174 states have (on average 1.1749130266718206) internal successors, (6079), 5174 states have internal predecessors, (6079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 6079 transitions. [2025-03-03 10:51:05,102 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 6079 transitions. Word has length 324 [2025-03-03 10:51:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:05,103 INFO L471 AbstractCegarLoop]: Abstraction has 5175 states and 6079 transitions. [2025-03-03 10:51:05,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 6079 transitions. [2025-03-03 10:51:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-03 10:51:05,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:05,108 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:05,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:51:05,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:05,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash 520747540, now seen corresponding path program 1 times [2025-03-03 10:51:05,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:05,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461007359] [2025-03-03 10:51:05,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:05,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:05,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-03 10:51:05,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-03 10:51:05,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:05,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:51:05,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:05,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461007359] [2025-03-03 10:51:05,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461007359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:05,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:05,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:05,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426736227] [2025-03-03 10:51:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:05,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:05,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:05,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:05,377 INFO L87 Difference]: Start difference. First operand 5175 states and 6079 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:06,422 INFO L93 Difference]: Finished difference Result 12151 states and 14569 transitions. [2025-03-03 10:51:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:06,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 383 [2025-03-03 10:51:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:06,440 INFO L225 Difference]: With dead ends: 12151 [2025-03-03 10:51:06,440 INFO L226 Difference]: Without dead ends: 7277 [2025-03-03 10:51:06,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:06,444 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 291 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:06,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:51:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2025-03-03 10:51:06,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 6380. [2025-03-03 10:51:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.1559805612164915) internal successors, (7374), 6379 states have internal predecessors, (7374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7374 transitions. [2025-03-03 10:51:06,515 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7374 transitions. Word has length 383 [2025-03-03 10:51:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:06,516 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7374 transitions. [2025-03-03 10:51:06,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7374 transitions. [2025-03-03 10:51:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-03 10:51:06,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:06,524 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:06,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:51:06,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:06,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash 615191502, now seen corresponding path program 1 times [2025-03-03 10:51:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:06,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824996657] [2025-03-03 10:51:06,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:06,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 10:51:06,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 10:51:06,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:06,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:51:06,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:06,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824996657] [2025-03-03 10:51:06,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824996657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:06,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:06,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082003186] [2025-03-03 10:51:06,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:06,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:06,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:06,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:06,785 INFO L87 Difference]: Start difference. First operand 6380 states and 7374 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:07,865 INFO L93 Difference]: Finished difference Result 14563 states and 17155 transitions. [2025-03-03 10:51:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:07,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 389 [2025-03-03 10:51:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:07,877 INFO L225 Difference]: With dead ends: 14563 [2025-03-03 10:51:07,877 INFO L226 Difference]: Without dead ends: 8484 [2025-03-03 10:51:07,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:07,883 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 248 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:07,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 604 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:51:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2025-03-03 10:51:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 7584. [2025-03-03 10:51:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 7583 states have (on average 1.1426875906633258) internal successors, (8665), 7583 states have internal predecessors, (8665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 8665 transitions. [2025-03-03 10:51:07,970 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 8665 transitions. Word has length 389 [2025-03-03 10:51:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:07,971 INFO L471 AbstractCegarLoop]: Abstraction has 7584 states and 8665 transitions. [2025-03-03 10:51:07,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 8665 transitions. [2025-03-03 10:51:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-03 10:51:07,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:07,976 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:07,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:51:07,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:07,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:07,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1962947368, now seen corresponding path program 1 times [2025-03-03 10:51:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352719563] [2025-03-03 10:51:07,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:08,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-03 10:51:08,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-03 10:51:08,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:08,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:51:08,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:08,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352719563] [2025-03-03 10:51:08,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352719563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:08,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:08,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:08,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277204564] [2025-03-03 10:51:08,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:08,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:08,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:08,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:08,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:08,172 INFO L87 Difference]: Start difference. First operand 7584 states and 8665 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:09,173 INFO L93 Difference]: Finished difference Result 16661 states and 19400 transitions. [2025-03-03 10:51:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 406 [2025-03-03 10:51:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:09,186 INFO L225 Difference]: With dead ends: 16661 [2025-03-03 10:51:09,186 INFO L226 Difference]: Without dead ends: 9378 [2025-03-03 10:51:09,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:09,193 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:09,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 617 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:51:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2025-03-03 10:51:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9374. [2025-03-03 10:51:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9374 states, 9373 states have (on average 1.1302677904619651) internal successors, (10594), 9373 states have internal predecessors, (10594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9374 states to 9374 states and 10594 transitions. [2025-03-03 10:51:09,272 INFO L78 Accepts]: Start accepts. Automaton has 9374 states and 10594 transitions. Word has length 406 [2025-03-03 10:51:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:09,273 INFO L471 AbstractCegarLoop]: Abstraction has 9374 states and 10594 transitions. [2025-03-03 10:51:09,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 9374 states and 10594 transitions. [2025-03-03 10:51:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-03 10:51:09,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:09,278 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:09,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:51:09,278 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:09,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash 662856324, now seen corresponding path program 1 times [2025-03-03 10:51:09,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:09,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065156350] [2025-03-03 10:51:09,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:09,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-03 10:51:09,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-03 10:51:09,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:09,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:51:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065156350] [2025-03-03 10:51:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065156350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745495969] [2025-03-03 10:51:09,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:09,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:09,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:09,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:51:09,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-03 10:51:09,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-03 10:51:09,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:09,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:09,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:51:09,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:51:09,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745495969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:09,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:51:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745887200] [2025-03-03 10:51:09,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:09,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:09,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:09,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:09,962 INFO L87 Difference]: Start difference. First operand 9374 states and 10594 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:11,360 INFO L93 Difference]: Finished difference Result 21504 states and 24725 transitions. [2025-03-03 10:51:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:11,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 414 [2025-03-03 10:51:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:11,382 INFO L225 Difference]: With dead ends: 21504 [2025-03-03 10:51:11,382 INFO L226 Difference]: Without dead ends: 12431 [2025-03-03 10:51:11,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:11,393 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 378 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:11,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 636 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:51:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12431 states. [2025-03-03 10:51:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12431 to 12425. [2025-03-03 10:51:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12425 states, 12424 states have (on average 1.1454443013522215) internal successors, (14231), 12424 states have internal predecessors, (14231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12425 states to 12425 states and 14231 transitions. [2025-03-03 10:51:11,502 INFO L78 Accepts]: Start accepts. Automaton has 12425 states and 14231 transitions. Word has length 414 [2025-03-03 10:51:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:11,503 INFO L471 AbstractCegarLoop]: Abstraction has 12425 states and 14231 transitions. [2025-03-03 10:51:11,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 12425 states and 14231 transitions. [2025-03-03 10:51:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-03 10:51:11,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:11,507 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:11,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:51:11,711 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,SelfDestructingSolverStorable10 [2025-03-03 10:51:11,711 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:11,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1394190895, now seen corresponding path program 1 times [2025-03-03 10:51:11,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:11,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987055845] [2025-03-03 10:51:11,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:11,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-03 10:51:11,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-03 10:51:11,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:11,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:51:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987055845] [2025-03-03 10:51:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987055845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:11,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:11,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:11,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437992505] [2025-03-03 10:51:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:11,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:11,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:11,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:11,996 INFO L87 Difference]: Start difference. First operand 12425 states and 14231 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:13,029 INFO L93 Difference]: Finished difference Result 32322 states and 37117 transitions. [2025-03-03 10:51:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:13,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 486 [2025-03-03 10:51:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:13,052 INFO L225 Difference]: With dead ends: 32322 [2025-03-03 10:51:13,053 INFO L226 Difference]: Without dead ends: 20198 [2025-03-03 10:51:13,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:13,066 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 308 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:13,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 172 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:51:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20198 states. [2025-03-03 10:51:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20198 to 17208. [2025-03-03 10:51:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17208 states, 17207 states have (on average 1.1444179694310455) internal successors, (19692), 17207 states have internal predecessors, (19692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17208 states to 17208 states and 19692 transitions. [2025-03-03 10:51:13,248 INFO L78 Accepts]: Start accepts. Automaton has 17208 states and 19692 transitions. Word has length 486 [2025-03-03 10:51:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:13,249 INFO L471 AbstractCegarLoop]: Abstraction has 17208 states and 19692 transitions. [2025-03-03 10:51:13,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17208 states and 19692 transitions. [2025-03-03 10:51:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-03 10:51:13,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:13,253 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:13,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:51:13,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:13,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1492905755, now seen corresponding path program 1 times [2025-03-03 10:51:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:13,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069414753] [2025-03-03 10:51:13,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:13,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:13,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-03 10:51:13,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-03 10:51:13,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:13,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 479 proven. 39 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-03 10:51:13,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:13,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069414753] [2025-03-03 10:51:13,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069414753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:13,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849178680] [2025-03-03 10:51:13,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:13,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:13,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:13,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:13,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:51:13,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-03 10:51:13,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-03 10:51:13,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:13,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:13,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:51:13,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-03 10:51:13,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:13,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849178680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:13,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:13,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:51:13,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341845434] [2025-03-03 10:51:13,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:13,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:13,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:13,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:13,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:13,817 INFO L87 Difference]: Start difference. First operand 17208 states and 19692 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:14,849 INFO L93 Difference]: Finished difference Result 37104 states and 42706 transitions. [2025-03-03 10:51:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:14,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 521 [2025-03-03 10:51:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:14,870 INFO L225 Difference]: With dead ends: 37104 [2025-03-03 10:51:14,870 INFO L226 Difference]: Without dead ends: 20197 [2025-03-03 10:51:14,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:51:14,884 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 380 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:14,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 445 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:51:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20197 states. [2025-03-03 10:51:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20197 to 15053. [2025-03-03 10:51:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15053 states, 15052 states have (on average 1.1298830720170077) internal successors, (17007), 15052 states have internal predecessors, (17007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 17007 transitions. [2025-03-03 10:51:15,025 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 17007 transitions. Word has length 521 [2025-03-03 10:51:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:15,026 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 17007 transitions. [2025-03-03 10:51:15,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 17007 transitions. [2025-03-03 10:51:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-03 10:51:15,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:15,030 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:15,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:51:15,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 10:51:15,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:15,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash -997689371, now seen corresponding path program 1 times [2025-03-03 10:51:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:15,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629515595] [2025-03-03 10:51:15,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:15,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 10:51:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 10:51:15,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:15,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 10:51:15,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:15,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629515595] [2025-03-03 10:51:15,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629515595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:15,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:15,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275688585] [2025-03-03 10:51:15,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:15,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:15,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:15,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:15,506 INFO L87 Difference]: Start difference. First operand 15053 states and 17007 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:16,531 INFO L93 Difference]: Finished difference Result 35799 states and 40820 transitions. [2025-03-03 10:51:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:16,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 525 [2025-03-03 10:51:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:16,552 INFO L225 Difference]: With dead ends: 35799 [2025-03-03 10:51:16,552 INFO L226 Difference]: Without dead ends: 21047 [2025-03-03 10:51:16,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:16,566 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:16,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:51:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21047 states. [2025-03-03 10:51:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21047 to 20139. [2025-03-03 10:51:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20139 states, 20138 states have (on average 1.122703346906346) internal successors, (22609), 20138 states have internal predecessors, (22609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20139 states to 20139 states and 22609 transitions. [2025-03-03 10:51:16,793 INFO L78 Accepts]: Start accepts. Automaton has 20139 states and 22609 transitions. Word has length 525 [2025-03-03 10:51:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:16,794 INFO L471 AbstractCegarLoop]: Abstraction has 20139 states and 22609 transitions. [2025-03-03 10:51:16,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 20139 states and 22609 transitions. [2025-03-03 10:51:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-03 10:51:16,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:16,803 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:16,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:51:16,804 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:16,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1335781714, now seen corresponding path program 1 times [2025-03-03 10:51:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076685565] [2025-03-03 10:51:16,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:16,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-03 10:51:16,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-03 10:51:16,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:16,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 556 proven. 39 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 10:51:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:17,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076685565] [2025-03-03 10:51:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076685565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:17,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325541083] [2025-03-03 10:51:17,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:17,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:17,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:17,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:17,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:51:17,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-03 10:51:17,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-03 10:51:17,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:17,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:17,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:51:17,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 556 proven. 39 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 10:51:17,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:51:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 556 proven. 39 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 10:51:18,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325541083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:51:18,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:51:18,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 10:51:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923656312] [2025-03-03 10:51:18,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:51:18,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:51:18,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:18,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:51:18,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:51:18,517 INFO L87 Difference]: Start difference. First operand 20139 states and 22609 transitions. Second operand has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:22,778 INFO L93 Difference]: Finished difference Result 48308 states and 53930 transitions. [2025-03-03 10:51:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:51:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 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 580 [2025-03-03 10:51:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:22,799 INFO L225 Difference]: With dead ends: 48308 [2025-03-03 10:51:22,799 INFO L226 Difference]: Without dead ends: 22230 [2025-03-03 10:51:22,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1169 GetRequests, 1155 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-03 10:51:22,809 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2433 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 7009 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2433 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 7572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 7009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:22,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2433 Valid, 317 Invalid, 7572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 7009 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 10:51:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22230 states. [2025-03-03 10:51:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22230 to 17444. [2025-03-03 10:51:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17444 states, 17443 states have (on average 1.0662730034971049) internal successors, (18599), 17443 states have internal predecessors, (18599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17444 states to 17444 states and 18599 transitions. [2025-03-03 10:51:22,942 INFO L78 Accepts]: Start accepts. Automaton has 17444 states and 18599 transitions. Word has length 580 [2025-03-03 10:51:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:22,942 INFO L471 AbstractCegarLoop]: Abstraction has 17444 states and 18599 transitions. [2025-03-03 10:51:22,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 17444 states and 18599 transitions. [2025-03-03 10:51:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 10:51:22,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:22,948 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:22,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:51:23,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:23,149 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:23,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1233171972, now seen corresponding path program 1 times [2025-03-03 10:51:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:23,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789263697] [2025-03-03 10:51:23,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:23,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:23,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 10:51:23,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 10:51:23,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:23,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-03 10:51:23,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:23,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789263697] [2025-03-03 10:51:23,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789263697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:23,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:23,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:23,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023755115] [2025-03-03 10:51:23,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:23,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:23,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:23,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:23,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:23,403 INFO L87 Difference]: Start difference. First operand 17444 states and 18599 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:24,142 INFO L93 Difference]: Finished difference Result 38486 states and 41127 transitions. [2025-03-03 10:51:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 599 [2025-03-03 10:51:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:24,161 INFO L225 Difference]: With dead ends: 38486 [2025-03-03 10:51:24,161 INFO L226 Difference]: Without dead ends: 21044 [2025-03-03 10:51:24,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:24,175 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 291 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:24,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 570 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:51:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21044 states. [2025-03-03 10:51:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21044 to 20147. [2025-03-03 10:51:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20147 states, 20146 states have (on average 1.057976769582051) internal successors, (21314), 20146 states have internal predecessors, (21314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20147 states to 20147 states and 21314 transitions. [2025-03-03 10:51:24,334 INFO L78 Accepts]: Start accepts. Automaton has 20147 states and 21314 transitions. Word has length 599 [2025-03-03 10:51:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:24,334 INFO L471 AbstractCegarLoop]: Abstraction has 20147 states and 21314 transitions. [2025-03-03 10:51:24,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 20147 states and 21314 transitions. [2025-03-03 10:51:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-03-03 10:51:24,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:24,338 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:24,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:51:24,338 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:24,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash 561216706, now seen corresponding path program 1 times [2025-03-03 10:51:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518496314] [2025-03-03 10:51:24,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:24,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-03 10:51:24,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-03 10:51:24,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:24,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-03-03 10:51:24,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:24,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518496314] [2025-03-03 10:51:24,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518496314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:24,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838776385] [2025-03-03 10:51:24,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:24,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:24,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:24,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:24,631 INFO L87 Difference]: Start difference. First operand 20147 states and 21314 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:25,308 INFO L93 Difference]: Finished difference Result 40290 states and 42637 transitions. [2025-03-03 10:51:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 620 [2025-03-03 10:51:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:25,328 INFO L225 Difference]: With dead ends: 40290 [2025-03-03 10:51:25,328 INFO L226 Difference]: Without dead ends: 20444 [2025-03-03 10:51:25,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:25,341 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:25,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:51:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20444 states. [2025-03-03 10:51:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20444 to 20145. [2025-03-03 10:51:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20145 states, 20144 states have (on average 1.057883240667196) internal successors, (21310), 20144 states have internal predecessors, (21310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20145 states to 20145 states and 21310 transitions. [2025-03-03 10:51:25,524 INFO L78 Accepts]: Start accepts. Automaton has 20145 states and 21310 transitions. Word has length 620 [2025-03-03 10:51:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:25,524 INFO L471 AbstractCegarLoop]: Abstraction has 20145 states and 21310 transitions. [2025-03-03 10:51:25,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 20145 states and 21310 transitions. [2025-03-03 10:51:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-03-03 10:51:25,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:25,528 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:25,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:51:25,528 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:25,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1141676121, now seen corresponding path program 1 times [2025-03-03 10:51:25,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:25,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403605261] [2025-03-03 10:51:25,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:25,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-03-03 10:51:25,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-03-03 10:51:25,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:25,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-03 10:51:25,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403605261] [2025-03-03 10:51:25,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403605261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:25,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:25,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:51:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853108664] [2025-03-03 10:51:25,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:25,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:51:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:25,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:51:25,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:25,790 INFO L87 Difference]: Start difference. First operand 20145 states and 21310 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:26,976 INFO L93 Difference]: Finished difference Result 42978 states and 45513 transitions. [2025-03-03 10:51:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:26,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 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 627 [2025-03-03 10:51:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:26,996 INFO L225 Difference]: With dead ends: 42978 [2025-03-03 10:51:26,996 INFO L226 Difference]: Without dead ends: 23134 [2025-03-03 10:51:27,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:27,008 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 624 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:27,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 431 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:51:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23134 states. [2025-03-03 10:51:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23134 to 22533. [2025-03-03 10:51:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.0468222971773478) internal successors, (23587), 22532 states have internal predecessors, (23587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 23587 transitions. [2025-03-03 10:51:27,161 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 23587 transitions. Word has length 627 [2025-03-03 10:51:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:27,161 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 23587 transitions. [2025-03-03 10:51:27,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 23587 transitions. [2025-03-03 10:51:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 10:51:27,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:27,165 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:27,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:51:27,166 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:27,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:27,166 INFO L85 PathProgramCache]: Analyzing trace with hash 164417855, now seen corresponding path program 1 times [2025-03-03 10:51:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:27,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984197100] [2025-03-03 10:51:27,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:27,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 10:51:27,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 10:51:27,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-03 10:51:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:27,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984197100] [2025-03-03 10:51:27,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984197100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:27,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:27,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:27,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352611300] [2025-03-03 10:51:27,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:27,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:27,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:27,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:27,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:27,491 INFO L87 Difference]: Start difference. First operand 22533 states and 23587 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:28,190 INFO L93 Difference]: Finished difference Result 50760 states and 53120 transitions. [2025-03-03 10:51:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:28,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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 661 [2025-03-03 10:51:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:28,215 INFO L225 Difference]: With dead ends: 50760 [2025-03-03 10:51:28,215 INFO L226 Difference]: Without dead ends: 28528 [2025-03-03 10:51:28,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:28,230 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 226 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:28,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 476 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:51:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28528 states. [2025-03-03 10:51:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28528 to 21935. [2025-03-03 10:51:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21935 states, 21934 states have (on average 1.0475973374669463) internal successors, (22978), 21934 states have internal predecessors, (22978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21935 states to 21935 states and 22978 transitions. [2025-03-03 10:51:28,410 INFO L78 Accepts]: Start accepts. Automaton has 21935 states and 22978 transitions. Word has length 661 [2025-03-03 10:51:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:28,410 INFO L471 AbstractCegarLoop]: Abstraction has 21935 states and 22978 transitions. [2025-03-03 10:51:28,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 21935 states and 22978 transitions. [2025-03-03 10:51:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-03-03 10:51:28,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:28,414 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:28,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:51:28,414 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:28,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash 453328413, now seen corresponding path program 1 times [2025-03-03 10:51:28,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:28,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113277980] [2025-03-03 10:51:28,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:28,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:28,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-03-03 10:51:28,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-03-03 10:51:28,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:28,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-03 10:51:28,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:28,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113277980] [2025-03-03 10:51:28,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113277980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:28,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:28,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493725926] [2025-03-03 10:51:28,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:28,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:28,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:28,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:28,738 INFO L87 Difference]: Start difference. First operand 21935 states and 22978 transitions. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:29,415 INFO L93 Difference]: Finished difference Result 45959 states and 48173 transitions. [2025-03-03 10:51:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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 674 [2025-03-03 10:51:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:29,436 INFO L225 Difference]: With dead ends: 45959 [2025-03-03 10:51:29,436 INFO L226 Difference]: Without dead ends: 24026 [2025-03-03 10:51:29,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:29,450 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 218 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:29,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 529 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:51:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24026 states. [2025-03-03 10:51:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24026 to 21323. [2025-03-03 10:51:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21323 states, 21322 states have (on average 1.045680517775068) internal successors, (22296), 21322 states have internal predecessors, (22296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21323 states to 21323 states and 22296 transitions. [2025-03-03 10:51:29,609 INFO L78 Accepts]: Start accepts. Automaton has 21323 states and 22296 transitions. Word has length 674 [2025-03-03 10:51:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:29,610 INFO L471 AbstractCegarLoop]: Abstraction has 21323 states and 22296 transitions. [2025-03-03 10:51:29,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 21323 states and 22296 transitions. [2025-03-03 10:51:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-03-03 10:51:29,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:29,614 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:29,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:51:29,614 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:29,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1200676930, now seen corresponding path program 1 times [2025-03-03 10:51:29,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:29,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347510482] [2025-03-03 10:51:29,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:29,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:29,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-03-03 10:51:29,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-03-03 10:51:29,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:29,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:51:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347510482] [2025-03-03 10:51:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347510482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:30,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134015887] [2025-03-03 10:51:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:30,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:30,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:30,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:30,009 INFO L87 Difference]: Start difference. First operand 21323 states and 22296 transitions. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:30,812 INFO L93 Difference]: Finished difference Result 46550 states and 48627 transitions. [2025-03-03 10:51:30,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:30,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 674 [2025-03-03 10:51:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:30,834 INFO L225 Difference]: With dead ends: 46550 [2025-03-03 10:51:30,834 INFO L226 Difference]: Without dead ends: 25528 [2025-03-03 10:51:30,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:30,848 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 261 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:30,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 124 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:51:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25528 states. [2025-03-03 10:51:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25528 to 22220. [2025-03-03 10:51:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22220 states, 22219 states have (on average 1.0442414150051758) internal successors, (23202), 22219 states have internal predecessors, (23202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22220 states to 22220 states and 23202 transitions. [2025-03-03 10:51:31,013 INFO L78 Accepts]: Start accepts. Automaton has 22220 states and 23202 transitions. Word has length 674 [2025-03-03 10:51:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:31,013 INFO L471 AbstractCegarLoop]: Abstraction has 22220 states and 23202 transitions. [2025-03-03 10:51:31,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22220 states and 23202 transitions. [2025-03-03 10:51:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-03-03 10:51:31,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:31,018 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:31,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:51:31,018 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:31,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash 387385342, now seen corresponding path program 1 times [2025-03-03 10:51:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:31,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264959347] [2025-03-03 10:51:31,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:31,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-03-03 10:51:31,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-03-03 10:51:31,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:31,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-03 10:51:31,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:31,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264959347] [2025-03-03 10:51:31,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264959347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:31,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:31,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:31,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499569371] [2025-03-03 10:51:31,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:31,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:31,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:31,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:31,365 INFO L87 Difference]: Start difference. First operand 22220 states and 23202 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:32,058 INFO L93 Difference]: Finished difference Result 47143 states and 49188 transitions. [2025-03-03 10:51:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 701 [2025-03-03 10:51:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:32,083 INFO L225 Difference]: With dead ends: 47143 [2025-03-03 10:51:32,083 INFO L226 Difference]: Without dead ends: 25224 [2025-03-03 10:51:32,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:32,099 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 352 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 116 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:51:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25224 states. [2025-03-03 10:51:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25224 to 21321. [2025-03-03 10:51:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21321 states, 21320 states have (on average 1.0440900562851783) internal successors, (22260), 21320 states have internal predecessors, (22260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21321 states to 21321 states and 22260 transitions. [2025-03-03 10:51:32,257 INFO L78 Accepts]: Start accepts. Automaton has 21321 states and 22260 transitions. Word has length 701 [2025-03-03 10:51:32,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:32,257 INFO L471 AbstractCegarLoop]: Abstraction has 21321 states and 22260 transitions. [2025-03-03 10:51:32,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21321 states and 22260 transitions. [2025-03-03 10:51:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-03-03 10:51:32,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:32,262 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:32,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:51:32,262 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:32,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1349118230, now seen corresponding path program 1 times [2025-03-03 10:51:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65665425] [2025-03-03 10:51:32,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:32,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-03-03 10:51:32,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-03-03 10:51:32,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:32,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 10:51:32,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:32,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65665425] [2025-03-03 10:51:32,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65665425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:32,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:32,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:32,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235942864] [2025-03-03 10:51:32,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:32,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:32,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:32,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:32,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:32,677 INFO L87 Difference]: Start difference. First operand 21321 states and 22260 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:33,367 INFO L93 Difference]: Finished difference Result 44134 states and 46112 transitions. [2025-03-03 10:51:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:33,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 722 [2025-03-03 10:51:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:33,386 INFO L225 Difference]: With dead ends: 44134 [2025-03-03 10:51:33,386 INFO L226 Difference]: Without dead ends: 22815 [2025-03-03 10:51:33,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:33,398 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 293 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:33,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 194 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:51:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22815 states. [2025-03-03 10:51:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22815 to 21618. [2025-03-03 10:51:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21618 states, 21617 states have (on average 1.040431142156636) internal successors, (22491), 21617 states have internal predecessors, (22491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 22491 transitions. [2025-03-03 10:51:33,545 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 22491 transitions. Word has length 722 [2025-03-03 10:51:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:33,545 INFO L471 AbstractCegarLoop]: Abstraction has 21618 states and 22491 transitions. [2025-03-03 10:51:33,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 22491 transitions. [2025-03-03 10:51:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2025-03-03 10:51:33,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:33,550 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:33,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:51:33,551 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1512758226, now seen corresponding path program 1 times [2025-03-03 10:51:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523217333] [2025-03-03 10:51:33,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes. [2025-03-03 10:51:33,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements. [2025-03-03 10:51:33,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:33,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-03 10:51:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523217333] [2025-03-03 10:51:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523217333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:33,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:33,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:51:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384684415] [2025-03-03 10:51:33,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:51:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:33,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:51:33,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:33,929 INFO L87 Difference]: Start difference. First operand 21618 states and 22491 transitions. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:35,015 INFO L93 Difference]: Finished difference Result 49531 states and 51478 transitions. [2025-03-03 10:51:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:35,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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 724 [2025-03-03 10:51:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:35,041 INFO L225 Difference]: With dead ends: 49531 [2025-03-03 10:51:35,041 INFO L226 Difference]: Without dead ends: 28214 [2025-03-03 10:51:35,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:35,056 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 515 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:35,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 159 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:51:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28214 states. [2025-03-03 10:51:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28214 to 26118. [2025-03-03 10:51:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26118 states, 26117 states have (on average 1.0387487077382547) internal successors, (27129), 26117 states have internal predecessors, (27129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26118 states to 26118 states and 27129 transitions. [2025-03-03 10:51:35,281 INFO L78 Accepts]: Start accepts. Automaton has 26118 states and 27129 transitions. Word has length 724 [2025-03-03 10:51:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:35,281 INFO L471 AbstractCegarLoop]: Abstraction has 26118 states and 27129 transitions. [2025-03-03 10:51:35,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26118 states and 27129 transitions. [2025-03-03 10:51:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2025-03-03 10:51:35,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:35,289 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:35,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:51:35,290 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:35,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1297866173, now seen corresponding path program 1 times [2025-03-03 10:51:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565283656] [2025-03-03 10:51:35,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:35,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 806 statements into 1 equivalence classes. [2025-03-03 10:51:35,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 806 of 806 statements. [2025-03-03 10:51:35,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:35,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2025-03-03 10:51:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:35,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565283656] [2025-03-03 10:51:35,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565283656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:35,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:35,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:35,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398381392] [2025-03-03 10:51:35,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:35,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:35,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:35,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:35,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:35,558 INFO L87 Difference]: Start difference. First operand 26118 states and 27129 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:36,244 INFO L93 Difference]: Finished difference Result 42616 states and 44150 transitions. [2025-03-03 10:51:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:36,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 806 [2025-03-03 10:51:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:36,260 INFO L225 Difference]: With dead ends: 42616 [2025-03-03 10:51:36,260 INFO L226 Difference]: Without dead ends: 16799 [2025-03-03 10:51:36,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:36,273 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 314 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:36,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 405 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:51:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2025-03-03 10:51:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 14104. [2025-03-03 10:51:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14104 states, 14103 states have (on average 1.0266609941147273) internal successors, (14479), 14103 states have internal predecessors, (14479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14104 states to 14104 states and 14479 transitions. [2025-03-03 10:51:36,446 INFO L78 Accepts]: Start accepts. Automaton has 14104 states and 14479 transitions. Word has length 806 [2025-03-03 10:51:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:36,446 INFO L471 AbstractCegarLoop]: Abstraction has 14104 states and 14479 transitions. [2025-03-03 10:51:36,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14104 states and 14479 transitions. [2025-03-03 10:51:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-03-03 10:51:36,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:36,460 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:51:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 10:51:36,460 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:36,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1113749331, now seen corresponding path program 1 times [2025-03-03 10:51:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880634571] [2025-03-03 10:51:36,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:36,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-03-03 10:51:36,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-03-03 10:51:36,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:36,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2025-03-03 10:51:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880634571] [2025-03-03 10:51:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880634571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:36,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736819566] [2025-03-03 10:51:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:36,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:36,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:36,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:36,879 INFO L87 Difference]: Start difference. First operand 14104 states and 14479 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:37,465 INFO L93 Difference]: Finished difference Result 33308 states and 34224 transitions. [2025-03-03 10:51:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:37,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 840 [2025-03-03 10:51:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:37,481 INFO L225 Difference]: With dead ends: 33308 [2025-03-03 10:51:37,481 INFO L226 Difference]: Without dead ends: 19206 [2025-03-03 10:51:37,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:37,488 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 289 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:37,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 405 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:51:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2025-03-03 10:51:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 17403. [2025-03-03 10:51:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17403 states, 17402 states have (on average 1.027295713136421) internal successors, (17877), 17402 states have internal predecessors, (17877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17403 states to 17403 states and 17877 transitions. [2025-03-03 10:51:37,622 INFO L78 Accepts]: Start accepts. Automaton has 17403 states and 17877 transitions. Word has length 840 [2025-03-03 10:51:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:37,622 INFO L471 AbstractCegarLoop]: Abstraction has 17403 states and 17877 transitions. [2025-03-03 10:51:37,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 17403 states and 17877 transitions. [2025-03-03 10:51:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2025-03-03 10:51:37,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:37,632 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:37,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 10:51:37,632 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:37,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1177494806, now seen corresponding path program 1 times [2025-03-03 10:51:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:37,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388691080] [2025-03-03 10:51:37,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:37,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes. [2025-03-03 10:51:37,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements. [2025-03-03 10:51:37,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:37,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2025-03-03 10:51:38,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388691080] [2025-03-03 10:51:38,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388691080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:38,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:38,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217509640] [2025-03-03 10:51:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:38,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:38,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:38,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:38,278 INFO L87 Difference]: Start difference. First operand 17403 states and 17877 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:38,788 INFO L93 Difference]: Finished difference Result 34809 states and 35757 transitions. [2025-03-03 10:51:38,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:38,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 888 [2025-03-03 10:51:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:38,802 INFO L225 Difference]: With dead ends: 34809 [2025-03-03 10:51:38,803 INFO L226 Difference]: Without dead ends: 17408 [2025-03-03 10:51:38,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:38,812 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 145 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:38,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 59 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:51:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17408 states. [2025-03-03 10:51:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17408 to 17104. [2025-03-03 10:51:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17104 states, 17103 states have (on average 1.0258434192831667) internal successors, (17545), 17103 states have internal predecessors, (17545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17104 states to 17104 states and 17545 transitions. [2025-03-03 10:51:38,978 INFO L78 Accepts]: Start accepts. Automaton has 17104 states and 17545 transitions. Word has length 888 [2025-03-03 10:51:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:38,979 INFO L471 AbstractCegarLoop]: Abstraction has 17104 states and 17545 transitions. [2025-03-03 10:51:38,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 17104 states and 17545 transitions. [2025-03-03 10:51:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2025-03-03 10:51:38,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:38,988 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:38,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 10:51:38,988 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:38,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1149601150, now seen corresponding path program 1 times [2025-03-03 10:51:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:38,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367829792] [2025-03-03 10:51:38,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:38,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:39,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 947 statements into 1 equivalence classes. [2025-03-03 10:51:39,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 947 of 947 statements. [2025-03-03 10:51:39,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:39,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-03-03 10:51:39,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:39,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367829792] [2025-03-03 10:51:39,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367829792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:39,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:39,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:51:39,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282234375] [2025-03-03 10:51:39,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:39,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:51:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:39,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:51:39,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:39,455 INFO L87 Difference]: Start difference. First operand 17104 states and 17545 transitions. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:40,270 INFO L93 Difference]: Finished difference Result 21303 states and 21835 transitions. [2025-03-03 10:51:40,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:51:40,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 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 947 [2025-03-03 10:51:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:40,286 INFO L225 Difference]: With dead ends: 21303 [2025-03-03 10:51:40,286 INFO L226 Difference]: Without dead ends: 21301 [2025-03-03 10:51:40,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:51:40,291 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 474 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:40,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 62 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:51:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21301 states. [2025-03-03 10:51:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21301 to 13804. [2025-03-03 10:51:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13804 states, 13803 states have (on average 1.026153734695356) internal successors, (14164), 13803 states have internal predecessors, (14164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 14164 transitions. [2025-03-03 10:51:40,410 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 14164 transitions. Word has length 947 [2025-03-03 10:51:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:40,411 INFO L471 AbstractCegarLoop]: Abstraction has 13804 states and 14164 transitions. [2025-03-03 10:51:40,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 14164 transitions. [2025-03-03 10:51:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2025-03-03 10:51:40,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:40,421 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:40,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 10:51:40,421 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:40,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash 890597034, now seen corresponding path program 1 times [2025-03-03 10:51:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:40,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768587324] [2025-03-03 10:51:40,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:40,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:40,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1033 statements into 1 equivalence classes. [2025-03-03 10:51:40,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1033 of 1033 statements. [2025-03-03 10:51:40,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:40,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-03-03 10:51:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768587324] [2025-03-03 10:51:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768587324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568377257] [2025-03-03 10:51:41,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:41,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:41,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:41,257 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-03 10:51:41,258 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-03 10:51:41,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1033 statements into 1 equivalence classes. [2025-03-03 10:51:41,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1033 of 1033 statements. [2025-03-03 10:51:41,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:41,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:41,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:51:41,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-03-03 10:51:44,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:51:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-03-03 10:51:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568377257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:51:45,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:51:45,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-03 10:51:45,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658523777] [2025-03-03 10:51:45,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:51:45,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 10:51:45,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:45,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 10:51:45,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:51:45,743 INFO L87 Difference]: Start difference. First operand 13804 states and 14164 transitions. Second operand has 10 states, 10 states have (on average 111.3) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:48,292 INFO L93 Difference]: Finished difference Result 24302 states and 24898 transitions. [2025-03-03 10:51:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 10:51:48,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 111.3) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 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 1033 [2025-03-03 10:51:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:48,314 INFO L225 Difference]: With dead ends: 24302 [2025-03-03 10:51:48,315 INFO L226 Difference]: Without dead ends: 24300 [2025-03-03 10:51:48,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2074 GetRequests, 2060 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-03 10:51:48,322 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 2343 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2343 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:48,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2343 Valid, 130 Invalid, 3449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 3096 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:51:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24300 states. [2025-03-03 10:51:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24300 to 13505. [2025-03-03 10:51:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13505 states, 13504 states have (on average 1.0265847156398105) internal successors, (13863), 13504 states have internal predecessors, (13863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13505 states to 13505 states and 13863 transitions. [2025-03-03 10:51:48,493 INFO L78 Accepts]: Start accepts. Automaton has 13505 states and 13863 transitions. Word has length 1033 [2025-03-03 10:51:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:48,493 INFO L471 AbstractCegarLoop]: Abstraction has 13505 states and 13863 transitions. [2025-03-03 10:51:48,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.3) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 13505 states and 13863 transitions. [2025-03-03 10:51:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2025-03-03 10:51:48,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:48,506 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:48,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:51:48,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 10:51:48,707 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:48,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1966293090, now seen corresponding path program 1 times [2025-03-03 10:51:48,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:48,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868183431] [2025-03-03 10:51:48,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:48,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1144 statements into 1 equivalence classes. [2025-03-03 10:51:48,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1144 of 1144 statements. [2025-03-03 10:51:48,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:48,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2261 backedges. 1510 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2025-03-03 10:51:49,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868183431] [2025-03-03 10:51:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868183431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:51:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:51:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096055735] [2025-03-03 10:51:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:49,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:51:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:49,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:51:49,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:49,719 INFO L87 Difference]: Start difference. First operand 13505 states and 13863 transitions. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:50,328 INFO L93 Difference]: Finished difference Result 26414 states and 27123 transitions. [2025-03-03 10:51:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:51:50,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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 1144 [2025-03-03 10:51:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:50,339 INFO L225 Difference]: With dead ends: 26414 [2025-03-03 10:51:50,339 INFO L226 Difference]: Without dead ends: 13210 [2025-03-03 10:51:50,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:51:50,347 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 47 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:50,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 68 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:51:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13210 states. [2025-03-03 10:51:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13210 to 12905. [2025-03-03 10:51:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12905 states, 12904 states have (on average 1.0247985120892746) internal successors, (13224), 12904 states have internal predecessors, (13224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12905 states to 12905 states and 13224 transitions. [2025-03-03 10:51:50,472 INFO L78 Accepts]: Start accepts. Automaton has 12905 states and 13224 transitions. Word has length 1144 [2025-03-03 10:51:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:50,473 INFO L471 AbstractCegarLoop]: Abstraction has 12905 states and 13224 transitions. [2025-03-03 10:51:50,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 12905 states and 13224 transitions. [2025-03-03 10:51:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1155 [2025-03-03 10:51:50,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:51:50,485 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:50,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 10:51:50,485 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:51:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:51:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1709504813, now seen corresponding path program 1 times [2025-03-03 10:51:50,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:51:50,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762347940] [2025-03-03 10:51:50,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:51:50,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1154 statements into 1 equivalence classes. [2025-03-03 10:51:50,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1154 of 1154 statements. [2025-03-03 10:51:50,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:50,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 1394 proven. 152 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2025-03-03 10:51:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:51:52,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762347940] [2025-03-03 10:51:52,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762347940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:51:52,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488430808] [2025-03-03 10:51:52,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:51:52,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:52,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:51:52,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:51:52,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:51:52,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1154 statements into 1 equivalence classes. [2025-03-03 10:51:52,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1154 of 1154 statements. [2025-03-03 10:51:52,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:51:52,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:51:52,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:51:52,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:51:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2025-03-03 10:51:52,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:51:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488430808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:51:52,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:51:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 10:51:52,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201305380] [2025-03-03 10:51:52,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:51:52,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:51:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:51:52,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:51:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:51:52,791 INFO L87 Difference]: Start difference. First operand 12905 states and 13224 transitions. Second operand has 5 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:51:53,889 INFO L93 Difference]: Finished difference Result 20700 states and 21226 transitions. [2025-03-03 10:51:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:51:53,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 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 1154 [2025-03-03 10:51:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:51:53,891 INFO L225 Difference]: With dead ends: 20700 [2025-03-03 10:51:53,891 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:51:53,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1152 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:51:53,897 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 778 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:51:53,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 86 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:51:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:51:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:51:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:51:53,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1154 [2025-03-03 10:51:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:51:53,898 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:51:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:51:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:51:53,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:51:53,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:51:53,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:51:54,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:51:54,103 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:51:54,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:52:09,088 WARN L286 SmtUtils]: Spent 14.98s on a formula simplification. DAG size of input: 708 DAG size of output: 826 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 10:52:12,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:52:12,425 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:52:12,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:52:12 BoogieIcfgContainer [2025-03-03 10:52:12,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:52:12,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:52:12,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:52:12,443 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:52:12,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:53" (3/4) ... [2025-03-03 10:52:12,446 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:52:12,472 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:52:12,474 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:52:12,475 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:52:12,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:52:12,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:52:12,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:52:12,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:52:12,629 INFO L158 Benchmark]: Toolchain (without parser) took 82049.18ms. Allocated memory was 167.8MB in the beginning and 998.2MB in the end (delta: 830.5MB). Free memory was 117.4MB in the beginning and 377.3MB in the end (delta: -259.9MB). Peak memory consumption was 574.3MB. Max. memory is 16.1GB. [2025-03-03 10:52:12,629 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:52:12,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.96ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 44.0MB in the end (delta: 73.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-03 10:52:12,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 159.89ms. Allocated memory is still 167.8MB. Free memory was 44.0MB in the beginning and 84.5MB in the end (delta: -40.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-03-03 10:52:12,630 INFO L158 Benchmark]: Boogie Preprocessor took 234.33ms. Allocated memory is still 167.8MB. Free memory was 84.5MB in the beginning and 94.7MB in the end (delta: -10.3MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2025-03-03 10:52:12,631 INFO L158 Benchmark]: IcfgBuilder took 1976.69ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 94.7MB in the beginning and 217.2MB in the end (delta: -122.5MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. [2025-03-03 10:52:12,632 INFO L158 Benchmark]: TraceAbstraction took 78817.70ms. Allocated memory was 285.2MB in the beginning and 998.2MB in the end (delta: 713.0MB). Free memory was 214.4MB in the beginning and 402.5MB in the end (delta: -188.1MB). Peak memory consumption was 692.6MB. Max. memory is 16.1GB. [2025-03-03 10:52:12,632 INFO L158 Benchmark]: Witness Printer took 184.54ms. Allocated memory is still 998.2MB. Free memory was 402.5MB in the beginning and 377.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:52:12,633 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.96ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 44.0MB in the end (delta: 73.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 159.89ms. Allocated memory is still 167.8MB. Free memory was 44.0MB in the beginning and 84.5MB in the end (delta: -40.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 234.33ms. Allocated memory is still 167.8MB. Free memory was 84.5MB in the beginning and 94.7MB in the end (delta: -10.3MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1976.69ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 94.7MB in the beginning and 217.2MB in the end (delta: -122.5MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. * TraceAbstraction took 78817.70ms. Allocated memory was 285.2MB in the beginning and 998.2MB in the end (delta: 713.0MB). Free memory was 214.4MB in the beginning and 402.5MB in the end (delta: -188.1MB). Peak memory consumption was 692.6MB. Max. memory is 16.1GB. * Witness Printer took 184.54ms. Allocated memory is still 998.2MB. Free memory was 402.5MB in the beginning and 377.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 128]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.4s, OverallIterations: 31, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14720 SdHoareTripleChecker+Valid, 32.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14720 mSDsluCounter, 10378 SdHoareTripleChecker+Invalid, 27.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1389 mSDsCounter, 5325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39527 IncrementalHoareTripleChecker+Invalid, 44852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5325 mSolverCounterUnsat, 8989 mSDtfsCounter, 39527 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5429 GetRequests, 5352 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26118occurred in iteration=24, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 62474 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 21509 NumberOfCodeBlocks, 21509 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 23084 ConstructedInterpolants, 187 QuantifiedInterpolants, 74815 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4399 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 38 InterpolantComputations, 29 PerfectInterpolantSequences, 27755/30441 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (a2 == 1)) && (0 <= ((long long) 585713 + a0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) 146 + a0))) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600001 + a0)))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) a0 + 600164))) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || ((((((((long long) 42 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 3672) <= 0)) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) && (2 <= a29)) && (0 <= ((long long) 599998 + a0)))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || (((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((2 == a2) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600001 + a0)))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a0 + 600164))) && (3 == a2)) && (((long long) a0 + 3672) <= 0)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 3672) <= 0)) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 4)))) || (((2 <= a29) && (((long long) 89 + a4) <= 0)) && (((long long) 98 + a0) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || ((((((a29 <= 41) && (3 != a2)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 599998 + a0))) && (((long long) a0 + 147) <= 0))) || ((((((3 != a2) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || ((((a29 <= 41) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60))) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600164))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600164))) || (((((long long) 89 + a4) <= 0) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600164)) && (a2 == 4))) || ((((44 <= a29) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60))) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600164))) || (((((a29 <= 41) && (((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1)))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 599998 + a0))) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600164))) || (((((3 != a2) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (0 <= ((long long) 599998 + a0))) && (((long long) a0 + 147) <= 0))) || (((3 != a2) && (((long long) 89 + a4) <= 0)) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:52:12,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE