./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label01.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_label01.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 d6090139f17d215360e170ecc95bb73008b0f6956bdca2966cee2f9efad851e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:48:57,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:48:57,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:48:57,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:48:57,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:48:57,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:48:57,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:48:57,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:48:57,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:48:57,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:48:57,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:48:57,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:48:57,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:48:57,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:48:57,744 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:48:57,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:48:57,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:48:57,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:48:57,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:48:57,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:48:57,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:48:57,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:48:57,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:48:57,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:48:57,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:48:57,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:48:57,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:48:57,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:48:57,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:48:57,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:48:57,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:48:57,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:48:57,747 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 -> d6090139f17d215360e170ecc95bb73008b0f6956bdca2966cee2f9efad851e4 [2025-03-03 10:48:57,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:48:57,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:48:57,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:48:57,992 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:48:57,992 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:48:57,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label01.c [2025-03-03 10:48:59,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d145c1dc5/5bec3eda131146949cb4100c0338d6eb/FLAG811ecd2f1 [2025-03-03 10:48:59,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:48:59,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label01.c [2025-03-03 10:48:59,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d145c1dc5/5bec3eda131146949cb4100c0338d6eb/FLAG811ecd2f1 [2025-03-03 10:48:59,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d145c1dc5/5bec3eda131146949cb4100c0338d6eb [2025-03-03 10:48:59,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:48:59,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:48:59,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:48:59,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:48:59,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:48:59,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:48:59" (1/1) ... [2025-03-03 10:48:59,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:48:59, skipping insertion in model container [2025-03-03 10:48:59,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:48:59" (1/1) ... [2025-03-03 10:48:59,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:48:59,880 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_label01.c[5470,5483] [2025-03-03 10:49:00,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:49:00,121 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:49:00,138 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_label01.c[5470,5483] [2025-03-03 10:49:00,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:49:00,296 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:49:00,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00 WrapperNode [2025-03-03 10:49:00,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:49:00,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:49:00,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:49:00,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:49:00,302 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:49:00" (1/1) ... [2025-03-03 10:49:00,320 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:49:00" (1/1) ... [2025-03-03 10:49:00,441 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-03 10:49:00,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:49:00,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:49:00,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:49:00,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:49:00,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,583 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:49:00,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,636 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:49:00,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:49:00,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:49:00,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:49:00,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (1/1) ... [2025-03-03 10:49:00,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:49:00,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:00,766 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:49:00,769 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:49:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:49:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:49:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:49:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:49:00,835 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:49:00,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:49:02,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-03 10:49:02,716 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-03 10:49:02,716 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:49:02,730 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:49:02,730 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:49:02,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:02 BoogieIcfgContainer [2025-03-03 10:49:02,731 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:49:02,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:49:02,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:49:02,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:49:02,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:48:59" (1/3) ... [2025-03-03 10:49:02,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23454316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:02, skipping insertion in model container [2025-03-03 10:49:02,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:00" (2/3) ... [2025-03-03 10:49:02,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23454316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:02, skipping insertion in model container [2025-03-03 10:49:02,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:02" (3/3) ... [2025-03-03 10:49:02,741 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label01.c [2025-03-03 10:49:02,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:49:02,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label01.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:49:02,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:49:02,815 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;@4c965904, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:49:02,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:49:02,820 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:49:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 10:49:02,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:02,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:02,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:02,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:02,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1734727365, now seen corresponding path program 1 times [2025-03-03 10:49:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:02,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374969015] [2025-03-03 10:49:02,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:02,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 10:49:02,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 10:49:02,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:02,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:03,088 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:49:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374969015] [2025-03-03 10:49:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374969015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:03,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:03,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654432492] [2025-03-03 10:49:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:03,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:03,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:03,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:03,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:03,109 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 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:04,493 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-03-03 10:49:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:04,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 10:49:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:04,503 INFO L225 Difference]: With dead ends: 1154 [2025-03-03 10:49:04,503 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 10:49:04,506 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:49:04,508 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 277 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 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:49:04,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 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:49:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 10:49:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-03-03 10:49:04,544 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:49:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-03-03 10:49:04,548 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 44 [2025-03-03 10:49:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:04,548 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-03-03 10:49:04,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-03-03 10:49:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 10:49:04,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:04,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:49:04,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:49:04,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:04,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash 430102409, now seen corresponding path program 1 times [2025-03-03 10:49:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25568406] [2025-03-03 10:49:04,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:04,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:04,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 10:49:04,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 10:49:04,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:04,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:04,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:04,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25568406] [2025-03-03 10:49:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25568406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:04,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425161002] [2025-03-03 10:49:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:04,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:04,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:04,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:04,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:04,880 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:05,944 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-03-03 10:49:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:05,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 10:49:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:05,948 INFO L225 Difference]: With dead ends: 1624 [2025-03-03 10:49:05,948 INFO L226 Difference]: Without dead ends: 963 [2025-03-03 10:49:05,949 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:49:05,950 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:05,950 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:49:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-03 10:49:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-03-03 10:49:05,974 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:49:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-03-03 10:49:05,977 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 109 [2025-03-03 10:49:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-03-03 10:49:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-03-03 10:49:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 10:49:05,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:05,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:49:05,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:05,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash -750698274, now seen corresponding path program 1 times [2025-03-03 10:49:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:05,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772939715] [2025-03-03 10:49:05,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:05,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 10:49:06,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 10:49:06,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:06,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772939715] [2025-03-03 10:49:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772939715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:49:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978537871] [2025-03-03 10:49:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:06,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:49:06,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:06,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:49:06,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:49:06,257 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:49:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:07,746 INFO L93 Difference]: Finished difference Result 2240 states and 3197 transitions. [2025-03-03 10:49:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-03 10:49:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:07,751 INFO L225 Difference]: With dead ends: 2240 [2025-03-03 10:49:07,751 INFO L226 Difference]: Without dead ends: 1578 [2025-03-03 10:49:07,753 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:49:07,753 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 939 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:07,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 324 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:49:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-03 10:49:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1266. [2025-03-03 10:49:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states 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:49:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions. [2025-03-03 10:49:07,808 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 114 [2025-03-03 10:49:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:07,808 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions. [2025-03-03 10:49:07,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:49:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions. [2025-03-03 10:49:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 10:49:07,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:07,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:07,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:49:07,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:07,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1964870496, now seen corresponding path program 1 times [2025-03-03 10:49:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:07,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232149228] [2025-03-03 10:49:07,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:07,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 10:49:07,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 10:49:07,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:07,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232149228] [2025-03-03 10:49:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232149228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:07,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:07,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30882636] [2025-03-03 10:49:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:07,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:49:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:07,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:49:07,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:49:07,950 INFO L87 Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:49:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:10,037 INFO L93 Difference]: Finished difference Result 4668 states and 6173 transitions. [2025-03-03 10:49:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-03 10:49:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:10,047 INFO L225 Difference]: With dead ends: 4668 [2025-03-03 10:49:10,047 INFO L226 Difference]: Without dead ends: 3404 [2025-03-03 10:49:10,049 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:49:10,049 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 517 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:10,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 375 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:49:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-03-03 10:49:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2025-03-03 10:49:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2025-03-03 10:49:10,105 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 135 [2025-03-03 10:49:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:10,105 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2025-03-03 10:49:10,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:49:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2025-03-03 10:49:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 10:49:10,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:10,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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:49:10,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:49:10,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:10,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1336488546, now seen corresponding path program 1 times [2025-03-03 10:49:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281682691] [2025-03-03 10:49:10,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:10,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 10:49:10,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 10:49:10,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:10,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 10:49:10,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:10,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281682691] [2025-03-03 10:49:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281682691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:10,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:10,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:10,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939571153] [2025-03-03 10:49:10,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:10,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:10,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:10,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:10,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:10,254 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:49:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:11,332 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2025-03-03 10:49:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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:49:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:11,346 INFO L225 Difference]: With dead ends: 8563 [2025-03-03 10:49:11,346 INFO L226 Difference]: Without dead ends: 5483 [2025-03-03 10:49:11,349 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:49:11,350 INFO L435 NwaCegarLoop]: 271 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, 338 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:49:11,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-03-03 10:49:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-03-03 10:49:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2025-03-03 10:49:11,417 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 203 [2025-03-03 10:49:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:11,418 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2025-03-03 10:49:11,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:49:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2025-03-03 10:49:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-03 10:49:11,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:11,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:49:11,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:49:11,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:11,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1833596396, now seen corresponding path program 1 times [2025-03-03 10:49:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81425968] [2025-03-03 10:49:11,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:11,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-03 10:49:11,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-03 10:49:11,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 10:49:11,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:11,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81425968] [2025-03-03 10:49:11,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81425968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:11,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:11,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085643303] [2025-03-03 10:49:11,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:11,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:11,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:11,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:11,860 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:12,761 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2025-03-03 10:49:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:12,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2025-03-03 10:49:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:12,773 INFO L225 Difference]: With dead ends: 10655 [2025-03-03 10:49:12,773 INFO L226 Difference]: Without dead ends: 5478 [2025-03-03 10:49:12,778 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:49:12,779 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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:49:12,780 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:49:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-03-03 10:49:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-03-03 10:49:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2025-03-03 10:49:12,841 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 305 [2025-03-03 10:49:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:12,841 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2025-03-03 10:49:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2025-03-03 10:49:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-03 10:49:12,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:12,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:49:12,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:49:12,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:12,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1685796341, now seen corresponding path program 1 times [2025-03-03 10:49:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:12,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527090447] [2025-03-03 10:49:12,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:12,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:12,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-03 10:49:12,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-03 10:49:12,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:12,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:49:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:13,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527090447] [2025-03-03 10:49:13,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527090447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:13,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:13,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500641094] [2025-03-03 10:49:13,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:13,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:13,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:13,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:13,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:13,081 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:49:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:14,228 INFO L93 Difference]: Finished difference Result 12758 states and 15193 transitions. [2025-03-03 10:49:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:14,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 331 [2025-03-03 10:49:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:14,244 INFO L225 Difference]: With dead ends: 12758 [2025-03-03 10:49:14,244 INFO L226 Difference]: Without dead ends: 7581 [2025-03-03 10:49:14,249 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:49:14,250 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 272 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:14,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2025-03-03 10:49:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7579. [2025-03-03 10:49:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7579 states, 7578 states have (on average 1.1421219319081553) internal successors, (8655), 7578 states have internal predecessors, (8655), 0 states have call successors, (0), 0 states 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:49:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7579 states to 7579 states and 8655 transitions. [2025-03-03 10:49:14,375 INFO L78 Accepts]: Start accepts. Automaton has 7579 states and 8655 transitions. Word has length 331 [2025-03-03 10:49:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:14,377 INFO L471 AbstractCegarLoop]: Abstraction has 7579 states and 8655 transitions. [2025-03-03 10:49:14,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:49:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7579 states and 8655 transitions. [2025-03-03 10:49:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-03 10:49:14,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:14,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:49:14,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:49:14,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1906709928, now seen corresponding path program 1 times [2025-03-03 10:49:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005666342] [2025-03-03 10:49:14,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:14,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 10:49:14,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 10:49:14,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:14,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:49:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005666342] [2025-03-03 10:49:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005666342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:14,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:14,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887442494] [2025-03-03 10:49:14,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:14,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:14,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:14,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:14,659 INFO L87 Difference]: Start difference. First operand 7579 states and 8655 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:49:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:15,754 INFO L93 Difference]: Finished difference Result 16956 states and 19716 transitions. [2025-03-03 10:49:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 390 [2025-03-03 10:49:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:15,785 INFO L225 Difference]: With dead ends: 16956 [2025-03-03 10:49:15,785 INFO L226 Difference]: Without dead ends: 9678 [2025-03-03 10:49:15,791 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:49:15,791 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 283 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:15,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 634 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9678 states. [2025-03-03 10:49:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9678 to 8781. [2025-03-03 10:49:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8781 states, 8780 states have (on average 1.1329157175398634) internal successors, (9947), 8780 states have internal predecessors, (9947), 0 states have call successors, (0), 0 states 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:49:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8781 states to 8781 states and 9947 transitions. [2025-03-03 10:49:15,891 INFO L78 Accepts]: Start accepts. Automaton has 8781 states and 9947 transitions. Word has length 390 [2025-03-03 10:49:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:15,892 INFO L471 AbstractCegarLoop]: Abstraction has 8781 states and 9947 transitions. [2025-03-03 10:49:15,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:49:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8781 states and 9947 transitions. [2025-03-03 10:49:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-03 10:49:15,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:15,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:15,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:49:15,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:15,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1478157698, now seen corresponding path program 1 times [2025-03-03 10:49:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:15,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707927629] [2025-03-03 10:49:15,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:15,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 10:49:15,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 10:49:15,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:15,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 83 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:16,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:16,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707927629] [2025-03-03 10:49:16,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707927629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:16,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11342383] [2025-03-03 10:49:16,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:16,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:16,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:16,490 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:49:16,491 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:49:16,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 10:49:16,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 10:49:16,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:16,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:16,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:49:16,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:17,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11342383] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:20,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:49:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2025-03-03 10:49:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964506975] [2025-03-03 10:49:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:20,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:49:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:20,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:49:20,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:49:20,076 INFO L87 Difference]: Start difference. First operand 8781 states and 9947 transitions. Second operand has 5 states, 5 states have (on average 78.2) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states 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:49:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:23,761 INFO L93 Difference]: Finished difference Result 24494 states and 28334 transitions. [2025-03-03 10:49:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:49:23,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 78.2) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 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 391 [2025-03-03 10:49:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:23,782 INFO L225 Difference]: With dead ends: 24494 [2025-03-03 10:49:23,782 INFO L226 Difference]: Without dead ends: 16014 [2025-03-03 10:49:23,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 776 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:49:23,788 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 765 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 1534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1534 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:23,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 105 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1534 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 10:49:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2025-03-03 10:49:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15078. [2025-03-03 10:49:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15078 states, 15077 states have (on average 1.160907342309478) internal successors, (17503), 15077 states have internal predecessors, (17503), 0 states have call successors, (0), 0 states 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:49:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15078 states to 15078 states and 17503 transitions. [2025-03-03 10:49:23,923 INFO L78 Accepts]: Start accepts. Automaton has 15078 states and 17503 transitions. Word has length 391 [2025-03-03 10:49:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:23,924 INFO L471 AbstractCegarLoop]: Abstraction has 15078 states and 17503 transitions. [2025-03-03 10:49:23,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.2) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states 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:49:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 15078 states and 17503 transitions. [2025-03-03 10:49:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-03 10:49:23,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:23,928 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:23,935 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:49:24,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:24,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash 14389781, now seen corresponding path program 1 times [2025-03-03 10:49:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671552489] [2025-03-03 10:49:24,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:24,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-03 10:49:24,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-03 10:49:24,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:24,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671552489] [2025-03-03 10:49:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671552489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95329204] [2025-03-03 10:49:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:24,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:24,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:24,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:24,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:24,314 INFO L87 Difference]: Start difference. First operand 15078 states and 17503 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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:49:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:25,425 INFO L93 Difference]: Finished difference Result 33447 states and 39636 transitions. [2025-03-03 10:49:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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 407 [2025-03-03 10:49:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:25,453 INFO L225 Difference]: With dead ends: 33447 [2025-03-03 10:49:25,454 INFO L226 Difference]: Without dead ends: 18670 [2025-03-03 10:49:25,465 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:49:25,466 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:25,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18670 states. [2025-03-03 10:49:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18670 to 17765. [2025-03-03 10:49:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17765 states, 17764 states have (on average 1.1506417473541994) internal successors, (20440), 17764 states have internal predecessors, (20440), 0 states have call successors, (0), 0 states 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:49:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17765 states to 17765 states and 20440 transitions. [2025-03-03 10:49:25,644 INFO L78 Accepts]: Start accepts. Automaton has 17765 states and 20440 transitions. Word has length 407 [2025-03-03 10:49:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:25,644 INFO L471 AbstractCegarLoop]: Abstraction has 17765 states and 20440 transitions. [2025-03-03 10:49:25,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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:49:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 17765 states and 20440 transitions. [2025-03-03 10:49:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-03 10:49:25,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:25,650 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:25,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:49:25,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:25,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1768414563, now seen corresponding path program 1 times [2025-03-03 10:49:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335635096] [2025-03-03 10:49:25,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:25,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 10:49:25,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 10:49:25,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:25,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 10:49:25,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335635096] [2025-03-03 10:49:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335635096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:25,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069405734] [2025-03-03 10:49:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:25,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:25,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:25,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:25,785 INFO L87 Difference]: Start difference. First operand 17765 states and 20440 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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:49:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:27,037 INFO L93 Difference]: Finished difference Result 42723 states and 49427 transitions. [2025-03-03 10:49:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 453 [2025-03-03 10:49:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:27,069 INFO L225 Difference]: With dead ends: 42723 [2025-03-03 10:49:27,069 INFO L226 Difference]: Without dead ends: 25259 [2025-03-03 10:49:27,085 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:49:27,086 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 283 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:27,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 623 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25259 states. [2025-03-03 10:49:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25259 to 24945. [2025-03-03 10:49:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24945 states, 24944 states have (on average 1.131213919178961) internal successors, (28217), 24944 states have internal predecessors, (28217), 0 states have call successors, (0), 0 states 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:49:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24945 states to 24945 states and 28217 transitions. [2025-03-03 10:49:27,319 INFO L78 Accepts]: Start accepts. Automaton has 24945 states and 28217 transitions. Word has length 453 [2025-03-03 10:49:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:27,320 INFO L471 AbstractCegarLoop]: Abstraction has 24945 states and 28217 transitions. [2025-03-03 10:49:27,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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:49:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24945 states and 28217 transitions. [2025-03-03 10:49:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-03 10:49:27,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:27,325 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:27,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:49:27,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:27,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1302479391, now seen corresponding path program 1 times [2025-03-03 10:49:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:27,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576969568] [2025-03-03 10:49:27,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:27,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 10:49:27,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 10:49:27,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:27,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 42 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:27,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:27,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576969568] [2025-03-03 10:49:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576969568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:27,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80824687] [2025-03-03 10:49:27,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:27,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:27,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:27,832 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:49:27,833 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:49:27,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 10:49:27,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 10:49:27,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:27,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:27,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:49:27,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 236 proven. 106 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 10:49:28,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 236 proven. 106 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 10:49:30,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80824687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:49:30,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:49:30,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2025-03-03 10:49:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158713248] [2025-03-03 10:49:30,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:49:30,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:49:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:30,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:49:30,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:49:30,414 INFO L87 Difference]: Start difference. First operand 24945 states and 28217 transitions. Second operand has 9 states, 9 states have (on average 118.0) internal successors, (1062), 8 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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:49:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:37,469 INFO L93 Difference]: Finished difference Result 90984 states and 102445 transitions. [2025-03-03 10:49:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 10:49:37,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 118.0) internal successors, (1062), 8 states have internal predecessors, (1062), 0 states have call successors, (0), 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 498 [2025-03-03 10:49:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:37,538 INFO L225 Difference]: With dead ends: 90984 [2025-03-03 10:49:37,539 INFO L226 Difference]: Without dead ends: 66340 [2025-03-03 10:49:37,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 992 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-03-03 10:49:37,561 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 5675 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 6546 mSolverCounterSat, 2949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5675 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 9495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2949 IncrementalHoareTripleChecker+Valid, 6546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:37,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5675 Valid, 257 Invalid, 9495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2949 Valid, 6546 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-03 10:49:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66340 states. [2025-03-03 10:49:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66340 to 46492. [2025-03-03 10:49:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46492 states, 46491 states have (on average 1.126863263857521) internal successors, (52389), 46491 states have internal predecessors, (52389), 0 states have call successors, (0), 0 states 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:49:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46492 states to 46492 states and 52389 transitions. [2025-03-03 10:49:38,110 INFO L78 Accepts]: Start accepts. Automaton has 46492 states and 52389 transitions. Word has length 498 [2025-03-03 10:49:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:38,111 INFO L471 AbstractCegarLoop]: Abstraction has 46492 states and 52389 transitions. [2025-03-03 10:49:38,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.0) internal successors, (1062), 8 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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:49:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 46492 states and 52389 transitions. [2025-03-03 10:49:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-03-03 10:49:38,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:38,114 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:38,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:49:38,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 10:49:38,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:38,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1864809761, now seen corresponding path program 1 times [2025-03-03 10:49:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:38,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025449894] [2025-03-03 10:49:38,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:38,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 10:49:38,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 10:49:38,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:38,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 125 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025449894] [2025-03-03 10:49:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025449894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223685566] [2025-03-03 10:49:38,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:38,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:38,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:38,986 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:49:38,988 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:49:39,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 10:49:39,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 10:49:39,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:39,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:39,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:49:39,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 125 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:39,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223685566] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:40,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:49:40,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-03 10:49:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704998276] [2025-03-03 10:49:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:40,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:49:40,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:40,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:49:40,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-03 10:49:40,610 INFO L87 Difference]: Start difference. First operand 46492 states and 52389 transitions. Second operand has 6 states, 6 states have (on average 85.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:49:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:43,992 INFO L93 Difference]: Finished difference Result 103495 states and 116247 transitions. [2025-03-03 10:49:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:49:43,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 85.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 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 510 [2025-03-03 10:49:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:44,046 INFO L225 Difference]: With dead ends: 103495 [2025-03-03 10:49:44,046 INFO L226 Difference]: Without dead ends: 57304 [2025-03-03 10:49:44,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1023 GetRequests, 1012 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-03 10:49:44,076 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1470 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 2085 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2085 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:44,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 96 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2085 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:49:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57304 states. [2025-03-03 10:49:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57304 to 44996. [2025-03-03 10:49:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44996 states, 44995 states have (on average 1.127036337370819) internal successors, (50711), 44995 states have internal predecessors, (50711), 0 states have call successors, (0), 0 states 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:49:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44996 states to 44996 states and 50711 transitions. [2025-03-03 10:49:44,588 INFO L78 Accepts]: Start accepts. Automaton has 44996 states and 50711 transitions. Word has length 510 [2025-03-03 10:49:44,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:44,589 INFO L471 AbstractCegarLoop]: Abstraction has 44996 states and 50711 transitions. [2025-03-03 10:49:44,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:49:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 44996 states and 50711 transitions. [2025-03-03 10:49:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 10:49:44,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:44,593 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:49:44,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:49:44,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:44,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:44,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash -349664747, now seen corresponding path program 1 times [2025-03-03 10:49:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:44,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979270771] [2025-03-03 10:49:44,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:44,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 10:49:44,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 10:49:44,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:44,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 493 proven. 39 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-03 10:49:45,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:45,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979270771] [2025-03-03 10:49:45,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979270771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:45,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924960932] [2025-03-03 10:49:45,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:45,106 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:49:45,107 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:49:45,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 10:49:45,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 10:49:45,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:45,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:45,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:49:45,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-03 10:49:45,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924960932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:45,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:49:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108359329] [2025-03-03 10:49:45,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:45,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:45,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:45,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:45,338 INFO L87 Difference]: Start difference. First operand 44996 states and 50711 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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:49:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:46,440 INFO L93 Difference]: Finished difference Result 95668 states and 108162 transitions. [2025-03-03 10:49:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 528 [2025-03-03 10:49:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:46,492 INFO L225 Difference]: With dead ends: 95668 [2025-03-03 10:49:46,492 INFO L226 Difference]: Without dead ends: 50973 [2025-03-03 10:49:46,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 527 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:49:46,521 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 372 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:46,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 442 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50973 states. [2025-03-03 10:49:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50973 to 49478. [2025-03-03 10:49:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49478 states, 49477 states have (on average 1.114922085009196) internal successors, (55163), 49477 states have internal predecessors, (55163), 0 states have call successors, (0), 0 states 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:49:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49478 states to 49478 states and 55163 transitions. [2025-03-03 10:49:47,147 INFO L78 Accepts]: Start accepts. Automaton has 49478 states and 55163 transitions. Word has length 528 [2025-03-03 10:49:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:47,148 INFO L471 AbstractCegarLoop]: Abstraction has 49478 states and 55163 transitions. [2025-03-03 10:49:47,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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:49:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 49478 states and 55163 transitions. [2025-03-03 10:49:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-03 10:49:47,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:47,158 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:47,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:49:47,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:47,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1437438180, now seen corresponding path program 1 times [2025-03-03 10:49:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605865409] [2025-03-03 10:49:47,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:47,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-03 10:49:47,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-03 10:49:47,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:47,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 640 proven. 39 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-03-03 10:49:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:47,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605865409] [2025-03-03 10:49:47,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605865409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:47,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724273770] [2025-03-03 10:49:47,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:47,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:47,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:47,767 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:49:47,768 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:49:47,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-03 10:49:47,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-03 10:49:47,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:47,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:47,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:49:47,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-03 10:49:48,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:48,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724273770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:48,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:48,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:49:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137256549] [2025-03-03 10:49:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:48,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:48,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:48,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:48,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:48,014 INFO L87 Difference]: Start difference. First operand 49478 states and 55163 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:49:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:49,104 INFO L93 Difference]: Finished difference Result 110013 states and 122747 transitions. [2025-03-03 10:49:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 602 [2025-03-03 10:49:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:49,165 INFO L225 Difference]: With dead ends: 110013 [2025-03-03 10:49:49,165 INFO L226 Difference]: Without dead ends: 60836 [2025-03-03 10:49:49,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 601 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:49:49,197 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 268 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:49,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 250 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60836 states. [2025-03-03 10:49:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60836 to 52461. [2025-03-03 10:49:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52461 states, 52460 states have (on average 1.1090926420129623) internal successors, (58183), 52460 states have internal predecessors, (58183), 0 states have call successors, (0), 0 states 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:49:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52461 states to 52461 states and 58183 transitions. [2025-03-03 10:49:49,716 INFO L78 Accepts]: Start accepts. Automaton has 52461 states and 58183 transitions. Word has length 602 [2025-03-03 10:49:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:49,716 INFO L471 AbstractCegarLoop]: Abstraction has 52461 states and 58183 transitions. [2025-03-03 10:49:49,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:49:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 52461 states and 58183 transitions. [2025-03-03 10:49:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-03-03 10:49:49,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:49,722 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1] [2025-03-03 10:49:49,728 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:49:49,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:49:49,923 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:49,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash -834674029, now seen corresponding path program 1 times [2025-03-03 10:49:49,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:49,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635900480] [2025-03-03 10:49:49,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:49,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:49,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-03 10:49:49,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-03 10:49:49,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:49,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 650 proven. 39 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-03-03 10:49:50,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:50,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635900480] [2025-03-03 10:49:50,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635900480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:50,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491194636] [2025-03-03 10:49:50,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:50,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:50,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:50,337 INFO L229 MonitoredProcess]: Starting monitored process 7 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:49:50,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:49:50,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-03 10:49:50,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-03 10:49:50,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:50,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:50,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:49:50,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-03 10:49:50,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:50,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491194636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:50,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:50,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:49:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132716038] [2025-03-03 10:49:50,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:50,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:50,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:50,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:50,571 INFO L87 Difference]: Start difference. First operand 52461 states and 58183 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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:49:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:51,806 INFO L93 Difference]: Finished difference Result 103420 states and 114744 transitions. [2025-03-03 10:49:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 607 [2025-03-03 10:49:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:51,864 INFO L225 Difference]: With dead ends: 103420 [2025-03-03 10:49:51,864 INFO L226 Difference]: Without dead ends: 51260 [2025-03-03 10:49:51,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 606 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:49:51,898 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 250 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:51,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 600 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51260 states. [2025-03-03 10:49:52,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51260 to 50063. [2025-03-03 10:49:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50063 states, 50062 states have (on average 1.0783628300906876) internal successors, (53985), 50062 states have internal predecessors, (53985), 0 states have call successors, (0), 0 states 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:49:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50063 states to 50063 states and 53985 transitions. [2025-03-03 10:49:52,488 INFO L78 Accepts]: Start accepts. Automaton has 50063 states and 53985 transitions. Word has length 607 [2025-03-03 10:49:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:52,489 INFO L471 AbstractCegarLoop]: Abstraction has 50063 states and 53985 transitions. [2025-03-03 10:49:52,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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:49:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 50063 states and 53985 transitions. [2025-03-03 10:49:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 10:49:52,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:52,503 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:52,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:49:52,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:49:52,703 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash -648356316, now seen corresponding path program 1 times [2025-03-03 10:49:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636980633] [2025-03-03 10:49:52,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:52,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 10:49:52,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 10:49:52,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:52,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 125 proven. 464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636980633] [2025-03-03 10:49:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636980633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690054093] [2025-03-03 10:49:53,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:53,689 INFO L229 MonitoredProcess]: Starting monitored process 8 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:49:53,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:49:53,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 10:49:53,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 10:49:53,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:53,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:53,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 10:49:53,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 589 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:54,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690054093] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:49:56,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-03-03 10:49:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534746582] [2025-03-03 10:49:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:56,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:49:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:56,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:49:56,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2025-03-03 10:49:56,185 INFO L87 Difference]: Start difference. First operand 50063 states and 53985 transitions. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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:49:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:58,676 INFO L93 Difference]: Finished difference Result 104040 states and 112100 transitions. [2025-03-03 10:49:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:49:58,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 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 685 [2025-03-03 10:49:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:58,728 INFO L225 Difference]: With dead ends: 104040 [2025-03-03 10:49:58,728 INFO L226 Difference]: Without dead ends: 54278 [2025-03-03 10:49:58,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1373 GetRequests, 1361 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2025-03-03 10:49:58,752 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 602 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:58,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 103 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:49:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54278 states. [2025-03-03 10:49:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54278 to 49465. [2025-03-03 10:49:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49465 states, 49464 states have (on average 1.0776120006469352) internal successors, (53303), 49464 states have internal predecessors, (53303), 0 states have call successors, (0), 0 states 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:49:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49465 states to 49465 states and 53303 transitions. [2025-03-03 10:49:59,197 INFO L78 Accepts]: Start accepts. Automaton has 49465 states and 53303 transitions. Word has length 685 [2025-03-03 10:49:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:59,198 INFO L471 AbstractCegarLoop]: Abstraction has 49465 states and 53303 transitions. [2025-03-03 10:49:59,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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:49:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 49465 states and 53303 transitions. [2025-03-03 10:49:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2025-03-03 10:49:59,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:59,214 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 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:49:59,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:49:59,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:59,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:59,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1673617700, now seen corresponding path program 1 times [2025-03-03 10:49:59,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:59,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461158937] [2025-03-03 10:49:59,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:59,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:59,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-03-03 10:49:59,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-03-03 10:49:59,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:59,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-03 10:49:59,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461158937] [2025-03-03 10:49:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461158937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687765477] [2025-03-03 10:49:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:59,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:59,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:59,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:59,903 INFO L87 Difference]: Start difference. First operand 49465 states and 53303 transitions. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:01,164 INFO L93 Difference]: Finished difference Result 107609 states and 115811 transitions. [2025-03-03 10:50:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 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 804 [2025-03-03 10:50:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:01,219 INFO L225 Difference]: With dead ends: 107609 [2025-03-03 10:50:01,219 INFO L226 Difference]: Without dead ends: 52764 [2025-03-03 10:50:01,253 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:50:01,253 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 141 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:01,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 661 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:50:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52764 states. [2025-03-03 10:50:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52764 to 47973. [2025-03-03 10:50:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47973 states, 47972 states have (on average 1.0617235053781373) internal successors, (50933), 47972 states have internal predecessors, (50933), 0 states have call successors, (0), 0 states 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:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47973 states to 47973 states and 50933 transitions. [2025-03-03 10:50:01,666 INFO L78 Accepts]: Start accepts. Automaton has 47973 states and 50933 transitions. Word has length 804 [2025-03-03 10:50:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:01,666 INFO L471 AbstractCegarLoop]: Abstraction has 47973 states and 50933 transitions. [2025-03-03 10:50:01,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 47973 states and 50933 transitions. [2025-03-03 10:50:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2025-03-03 10:50:01,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:01,687 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:01,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:50:01,687 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:01,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -462888155, now seen corresponding path program 1 times [2025-03-03 10:50:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:01,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477510004] [2025-03-03 10:50:01,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:01,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 824 statements into 1 equivalence classes. [2025-03-03 10:50:01,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 824 of 824 statements. [2025-03-03 10:50:01,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:01,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 962 proven. 39 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-03-03 10:50:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477510004] [2025-03-03 10:50:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477510004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474806420] [2025-03-03 10:50:02,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:02,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:02,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:02,237 INFO L229 MonitoredProcess]: Starting monitored process 9 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:50:02,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 10:50:02,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 824 statements into 1 equivalence classes. [2025-03-03 10:50:02,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 824 of 824 statements. [2025-03-03 10:50:02,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:02,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:02,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:50:02,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 962 proven. 39 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-03-03 10:50:02,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:50:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 962 proven. 39 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-03-03 10:50:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474806420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:50:03,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:50:03,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 10:50:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336865568] [2025-03-03 10:50:03,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:50:03,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:50:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:03,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:50:03,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:50:03,400 INFO L87 Difference]: Start difference. First operand 47973 states and 50933 transitions. Second operand has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 8 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:06,837 INFO L93 Difference]: Finished difference Result 102637 states and 108791 transitions. [2025-03-03 10:50:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:50:06,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 8 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 824 [2025-03-03 10:50:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:06,870 INFO L225 Difference]: With dead ends: 102637 [2025-03-03 10:50:06,870 INFO L226 Difference]: Without dead ends: 38403 [2025-03-03 10:50:06,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1657 GetRequests, 1643 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:50:06,892 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 3355 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4645 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3355 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 5177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 4645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:06,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3355 Valid, 196 Invalid, 5177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 4645 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:50:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38403 states. [2025-03-03 10:50:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38403 to 26719. [2025-03-03 10:50:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26719 states, 26718 states have (on average 1.03248746163635) internal successors, (27586), 26718 states have internal predecessors, (27586), 0 states have call successors, (0), 0 states 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:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26719 states to 26719 states and 27586 transitions. [2025-03-03 10:50:07,139 INFO L78 Accepts]: Start accepts. Automaton has 26719 states and 27586 transitions. Word has length 824 [2025-03-03 10:50:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:07,139 INFO L471 AbstractCegarLoop]: Abstraction has 26719 states and 27586 transitions. [2025-03-03 10:50:07,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 8 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26719 states and 27586 transitions. [2025-03-03 10:50:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-03-03 10:50:07,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:07,151 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 10:50:07,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:07,352 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:07,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1535199942, now seen corresponding path program 1 times [2025-03-03 10:50:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906635972] [2025-03-03 10:50:07,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:07,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-03-03 10:50:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-03-03 10:50:07,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:07,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-03-03 10:50:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906635972] [2025-03-03 10:50:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906635972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:07,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:07,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615109054] [2025-03-03 10:50:07,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:07,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:07,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:07,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:07,620 INFO L87 Difference]: Start difference. First operand 26719 states and 27586 transitions. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:08,255 INFO L93 Difference]: Finished difference Result 53434 states and 55180 transitions. [2025-03-03 10:50:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:08,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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 853 [2025-03-03 10:50:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:08,278 INFO L225 Difference]: With dead ends: 53434 [2025-03-03 10:50:08,278 INFO L226 Difference]: Without dead ends: 27016 [2025-03-03 10:50:08,293 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:50:08,293 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 435 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:08,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 68 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:50:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27016 states. [2025-03-03 10:50:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27016 to 26717. [2025-03-03 10:50:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26717 states, 26716 states have (on average 1.0324150321904477) internal successors, (27582), 26716 states have internal predecessors, (27582), 0 states have call successors, (0), 0 states 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:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26717 states to 26717 states and 27582 transitions. [2025-03-03 10:50:08,493 INFO L78 Accepts]: Start accepts. Automaton has 26717 states and 27582 transitions. Word has length 853 [2025-03-03 10:50:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:08,494 INFO L471 AbstractCegarLoop]: Abstraction has 26717 states and 27582 transitions. [2025-03-03 10:50:08,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 26717 states and 27582 transitions. [2025-03-03 10:50:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2025-03-03 10:50:08,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:08,505 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:50:08,505 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:08,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash -109425425, now seen corresponding path program 1 times [2025-03-03 10:50:08,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:08,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731192831] [2025-03-03 10:50:08,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:08,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:08,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 878 statements into 1 equivalence classes. [2025-03-03 10:50:08,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 878 of 878 statements. [2025-03-03 10:50:08,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:08,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 1056 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-03 10:50:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731192831] [2025-03-03 10:50:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731192831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:08,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312734940] [2025-03-03 10:50:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:08,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:08,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:08,858 INFO L87 Difference]: Start difference. First operand 26717 states and 27582 transitions. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:09,943 INFO L93 Difference]: Finished difference Result 54629 states and 56421 transitions. [2025-03-03 10:50:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:09,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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 878 [2025-03-03 10:50:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:09,970 INFO L225 Difference]: With dead ends: 54629 [2025-03-03 10:50:09,970 INFO L226 Difference]: Without dead ends: 28213 [2025-03-03 10:50:09,985 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:50:09,986 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 574 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:09,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 429 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:50:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28213 states. [2025-03-03 10:50:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28213 to 26417. [2025-03-03 10:50:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26417 states, 26416 states have (on average 1.026953361599031) internal successors, (27128), 26416 states have internal predecessors, (27128), 0 states have call successors, (0), 0 states 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:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26417 states to 26417 states and 27128 transitions. [2025-03-03 10:50:10,203 INFO L78 Accepts]: Start accepts. Automaton has 26417 states and 27128 transitions. Word has length 878 [2025-03-03 10:50:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:10,203 INFO L471 AbstractCegarLoop]: Abstraction has 26417 states and 27128 transitions. [2025-03-03 10:50:10,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 26417 states and 27128 transitions. [2025-03-03 10:50:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2025-03-03 10:50:10,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:10,216 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:50:10,217 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:10,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash 947420307, now seen corresponding path program 1 times [2025-03-03 10:50:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:10,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657295067] [2025-03-03 10:50:10,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:10,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 935 statements into 1 equivalence classes. [2025-03-03 10:50:10,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 935 of 935 statements. [2025-03-03 10:50:10,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:10,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 911 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2025-03-03 10:50:10,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657295067] [2025-03-03 10:50:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657295067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:10,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:10,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:10,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754361552] [2025-03-03 10:50:10,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:10,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:10,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:10,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:10,465 INFO L87 Difference]: Start difference. First operand 26417 states and 27128 transitions. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:11,128 INFO L93 Difference]: Finished difference Result 53124 states and 54549 transitions. [2025-03-03 10:50:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:11,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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 935 [2025-03-03 10:50:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:11,153 INFO L225 Difference]: With dead ends: 53124 [2025-03-03 10:50:11,153 INFO L226 Difference]: Without dead ends: 27008 [2025-03-03 10:50:11,168 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:50:11,169 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 338 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:11,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 457 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:50:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2025-03-03 10:50:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22219. [2025-03-03 10:50:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22219 states, 22218 states have (on average 1.0238545323611485) internal successors, (22748), 22218 states have internal predecessors, (22748), 0 states have call successors, (0), 0 states 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:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22219 states to 22219 states and 22748 transitions. [2025-03-03 10:50:11,429 INFO L78 Accepts]: Start accepts. Automaton has 22219 states and 22748 transitions. Word has length 935 [2025-03-03 10:50:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:11,430 INFO L471 AbstractCegarLoop]: Abstraction has 22219 states and 22748 transitions. [2025-03-03 10:50:11,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22219 states and 22748 transitions. [2025-03-03 10:50:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1125 [2025-03-03 10:50:11,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:11,443 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, 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, 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, 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] [2025-03-03 10:50:11,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:50:11,443 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:11,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash 576589067, now seen corresponding path program 1 times [2025-03-03 10:50:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454635511] [2025-03-03 10:50:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:11,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1124 statements into 1 equivalence classes. [2025-03-03 10:50:11,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1124 of 1124 statements. [2025-03-03 10:50:11,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:11,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 1416 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-03-03 10:50:11,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454635511] [2025-03-03 10:50:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454635511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:11,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944822734] [2025-03-03 10:50:11,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:11,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:11,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:11,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:11,943 INFO L87 Difference]: Start difference. First operand 22219 states and 22748 transitions. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:12,536 INFO L93 Difference]: Finished difference Result 37522 states and 38421 transitions. [2025-03-03 10:50:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 1124 [2025-03-03 10:50:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:12,537 INFO L225 Difference]: With dead ends: 37522 [2025-03-03 10:50:12,537 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:50:12,550 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:50:12,551 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 248 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:12,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 70 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:50:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:50:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:50:12,551 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:50:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:50:12,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1124 [2025-03-03 10:50:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:12,552 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:50:12,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:50:12,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:50:12,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:50:12,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:50:12,557 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] [2025-03-03 10:50:12,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.