./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.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 c82e02bad63eada28ee405f8cd74dfaf9484d0aadaa27f27fe076fa722fdcdb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:08:58,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:08:58,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:08:58,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:08:58,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:08:58,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:08:58,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:08:58,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:08:58,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:08:58,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:08:58,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:08:58,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:08:58,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:08:58,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:08:58,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:08:58,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:08:58,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:08:58,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:08:58,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:08:58,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:08:58,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:08:58,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:08:58,485 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 -> c82e02bad63eada28ee405f8cd74dfaf9484d0aadaa27f27fe076fa722fdcdb7 [2025-03-16 19:08:58,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:08:58,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:08:58,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:08:58,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:08:58,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:08:58,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2025-03-16 19:08:59,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44edef695/a88c93869c7044458de2dd3b5d12a741/FLAG6ac19d995 [2025-03-16 19:09:00,142 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:09:00,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2025-03-16 19:09:00,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44edef695/a88c93869c7044458de2dd3b5d12a741/FLAG6ac19d995 [2025-03-16 19:09:00,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44edef695/a88c93869c7044458de2dd3b5d12a741 [2025-03-16 19:09:00,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:09:00,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:09:00,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:09:00,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:09:00,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:09:00,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4aa56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00, skipping insertion in model container [2025-03-16 19:09:00,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:09:00,649 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/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865] [2025-03-16 19:09:00,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:09:00,665 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:09:00,731 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/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865] [2025-03-16 19:09:00,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:09:00,756 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:09:00,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00 WrapperNode [2025-03-16 19:09:00,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:09:00,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:09:00,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:09:00,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:09:00,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,806 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 448 [2025-03-16 19:09:00,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:09:00,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:09:00,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:09:00,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:09:00,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:09:00,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:09:00,873 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:09:00,873 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:09:00,873 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:09:00,874 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (1/1) ... [2025-03-16 19:09:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:09:00,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:00,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:09:00,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:09:00,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:09:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:09:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:09:00,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:09:00,985 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:09:00,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:09:01,411 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-16 19:09:01,411 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:09:01,421 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:09:01,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:09:01,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:09:01 BoogieIcfgContainer [2025-03-16 19:09:01,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:09:01,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:09:01,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:09:01,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:09:01,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:09:00" (1/3) ... [2025-03-16 19:09:01,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62220695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:09:01, skipping insertion in model container [2025-03-16 19:09:01,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:00" (2/3) ... [2025-03-16 19:09:01,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62220695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:09:01, skipping insertion in model container [2025-03-16 19:09:01,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:09:01" (3/3) ... [2025-03-16 19:09:01,429 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2025-03-16 19:09:01,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:09:01,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c that has 1 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:09:01,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:09:01,502 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;@3cb82662, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:09:01,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:09:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 115 states have (on average 1.7826086956521738) internal successors, (205), 116 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 19:09:01,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:01,514 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] [2025-03-16 19:09:01,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:01,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1522778238, now seen corresponding path program 1 times [2025-03-16 19:09:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56635323] [2025-03-16 19:09:01,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:01,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 19:09:01,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 19:09:01,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:01,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:01,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:01,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56635323] [2025-03-16 19:09:01,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56635323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:01,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:01,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:09:01,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500783601] [2025-03-16 19:09:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:01,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:09:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:01,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:09:01,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:09:01,747 INFO L87 Difference]: Start difference. First operand has 117 states, 115 states have (on average 1.7826086956521738) internal successors, (205), 116 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:01,775 INFO L93 Difference]: Finished difference Result 188 states and 323 transitions. [2025-03-16 19:09:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:09:01,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 19:09:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:01,782 INFO L225 Difference]: With dead ends: 188 [2025-03-16 19:09:01,783 INFO L226 Difference]: Without dead ends: 115 [2025-03-16 19:09:01,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:09:01,787 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:01,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-16 19:09:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-16 19:09:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.763157894736842) internal successors, (201), 114 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 201 transitions. [2025-03-16 19:09:01,813 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 201 transitions. Word has length 34 [2025-03-16 19:09:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:01,813 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 201 transitions. [2025-03-16 19:09:01,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 201 transitions. [2025-03-16 19:09:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 19:09:01,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:01,814 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] [2025-03-16 19:09:01,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:09:01,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:01,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1171978301, now seen corresponding path program 1 times [2025-03-16 19:09:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220034369] [2025-03-16 19:09:01,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:01,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 19:09:01,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 19:09:01,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:01,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:02,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-16 19:09:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220034369] [2025-03-16 19:09:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220034369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:02,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:02,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:09:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732731928] [2025-03-16 19:09:02,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:02,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:09:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:02,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:09:02,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:02,091 INFO L87 Difference]: Start difference. First operand 115 states and 201 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:02,165 INFO L93 Difference]: Finished difference Result 188 states and 319 transitions. [2025-03-16 19:09:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:09:02,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 19:09:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:02,166 INFO L225 Difference]: With dead ends: 188 [2025-03-16 19:09:02,167 INFO L226 Difference]: Without dead ends: 115 [2025-03-16 19:09:02,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:02,167 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:02,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-16 19:09:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-16 19:09:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.4035087719298245) internal successors, (160), 114 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2025-03-16 19:09:02,173 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 34 [2025-03-16 19:09:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:02,173 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2025-03-16 19:09:02,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2025-03-16 19:09:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:09:02,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:02,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:02,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:09:02,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash -813921381, now seen corresponding path program 1 times [2025-03-16 19:09:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850919434] [2025-03-16 19:09:02,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:02,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:09:02,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:09:02,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:02,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:02,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850919434] [2025-03-16 19:09:02,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850919434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:02,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:02,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016025498] [2025-03-16 19:09:02,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:02,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:02,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:02,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:02,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:02,296 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:02,320 INFO L93 Difference]: Finished difference Result 247 states and 376 transitions. [2025-03-16 19:09:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:02,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 19:09:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:02,322 INFO L225 Difference]: With dead ends: 247 [2025-03-16 19:09:02,322 INFO L226 Difference]: Without dead ends: 177 [2025-03-16 19:09:02,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:02,325 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 91 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:02,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 329 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-16 19:09:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2025-03-16 19:09:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.4885057471264367) internal successors, (259), 174 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 259 transitions. [2025-03-16 19:09:02,345 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 259 transitions. Word has length 74 [2025-03-16 19:09:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:02,345 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 259 transitions. [2025-03-16 19:09:02,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 259 transitions. [2025-03-16 19:09:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:09:02,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:02,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:02,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:09:02,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:02,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash -115089970, now seen corresponding path program 1 times [2025-03-16 19:09:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:02,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992037745] [2025-03-16 19:09:02,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:02,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:02,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:09:02,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:09:02,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:02,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:02,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:02,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992037745] [2025-03-16 19:09:02,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992037745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:02,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:02,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:02,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443963598] [2025-03-16 19:09:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:02,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:02,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:02,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:02,445 INFO L87 Difference]: Start difference. First operand 175 states and 259 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:02,464 INFO L93 Difference]: Finished difference Result 419 states and 659 transitions. [2025-03-16 19:09:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 19:09:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:02,467 INFO L225 Difference]: With dead ends: 419 [2025-03-16 19:09:02,467 INFO L226 Difference]: Without dead ends: 289 [2025-03-16 19:09:02,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:02,468 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 87 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:02,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 326 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-16 19:09:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2025-03-16 19:09:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.5454545454545454) internal successors, (442), 286 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 442 transitions. [2025-03-16 19:09:02,480 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 442 transitions. Word has length 74 [2025-03-16 19:09:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:02,481 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 442 transitions. [2025-03-16 19:09:02,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 442 transitions. [2025-03-16 19:09:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:09:02,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:02,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:02,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:09:02,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:02,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:02,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1893351809, now seen corresponding path program 1 times [2025-03-16 19:09:02,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:02,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528912020] [2025-03-16 19:09:02,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:02,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:09:02,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:09:02,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:02,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528912020] [2025-03-16 19:09:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528912020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190652367] [2025-03-16 19:09:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:02,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:02,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:02,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:02,576 INFO L87 Difference]: Start difference. First operand 287 states and 442 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:02,596 INFO L93 Difference]: Finished difference Result 739 states and 1180 transitions. [2025-03-16 19:09:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:02,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 19:09:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:02,598 INFO L225 Difference]: With dead ends: 739 [2025-03-16 19:09:02,598 INFO L226 Difference]: Without dead ends: 497 [2025-03-16 19:09:02,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:02,599 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 83 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:02,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 323 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-16 19:09:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 495. [2025-03-16 19:09:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.5748987854251013) internal successors, (778), 494 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 778 transitions. [2025-03-16 19:09:02,614 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 778 transitions. Word has length 74 [2025-03-16 19:09:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:02,615 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 778 transitions. [2025-03-16 19:09:02,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 778 transitions. [2025-03-16 19:09:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:09:02,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:02,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:02,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:09:02,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:02,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1880852812, now seen corresponding path program 1 times [2025-03-16 19:09:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:02,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646152699] [2025-03-16 19:09:02,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:02,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:09:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:09:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:02,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:02,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:02,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646152699] [2025-03-16 19:09:02,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646152699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:02,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:02,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:02,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826427583] [2025-03-16 19:09:02,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:02,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:02,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:02,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:02,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:02,813 INFO L87 Difference]: Start difference. First operand 495 states and 778 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:02,995 INFO L93 Difference]: Finished difference Result 3645 states and 5909 transitions. [2025-03-16 19:09:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:02,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 19:09:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:03,011 INFO L225 Difference]: With dead ends: 3645 [2025-03-16 19:09:03,012 INFO L226 Difference]: Without dead ends: 3195 [2025-03-16 19:09:03,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:03,016 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 1452 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:03,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 1618 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2025-03-16 19:09:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 943. [2025-03-16 19:09:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.585987261146497) internal successors, (1494), 942 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1494 transitions. [2025-03-16 19:09:03,085 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1494 transitions. Word has length 74 [2025-03-16 19:09:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:03,085 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1494 transitions. [2025-03-16 19:09:03,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1494 transitions. [2025-03-16 19:09:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:09:03,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:03,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:03,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:09:03,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:03,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1824060240, now seen corresponding path program 1 times [2025-03-16 19:09:03,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:03,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598795116] [2025-03-16 19:09:03,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:03,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:09:03,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:09:03,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:03,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:03,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598795116] [2025-03-16 19:09:03,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598795116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:03,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:03,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046530677] [2025-03-16 19:09:03,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:03,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:03,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:03,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:03,393 INFO L87 Difference]: Start difference. First operand 943 states and 1494 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:03,437 INFO L93 Difference]: Finished difference Result 977 states and 1543 transitions. [2025-03-16 19:09:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-16 19:09:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:03,441 INFO L225 Difference]: With dead ends: 977 [2025-03-16 19:09:03,441 INFO L226 Difference]: Without dead ends: 975 [2025-03-16 19:09:03,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:03,443 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:03,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-16 19:09:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2025-03-16 19:09:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.566735112936345) internal successors, (1526), 974 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1526 transitions. [2025-03-16 19:09:03,476 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1526 transitions. Word has length 75 [2025-03-16 19:09:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:03,476 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1526 transitions. [2025-03-16 19:09:03,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1526 transitions. [2025-03-16 19:09:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:09:03,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:03,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:09:03,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 714154484, now seen corresponding path program 1 times [2025-03-16 19:09:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413509371] [2025-03-16 19:09:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:09:03,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:09:03,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:03,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:03,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413509371] [2025-03-16 19:09:03,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413509371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:03,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:03,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20874727] [2025-03-16 19:09:03,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:03,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:03,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:03,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:03,559 INFO L87 Difference]: Start difference. First operand 975 states and 1526 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:03,603 INFO L93 Difference]: Finished difference Result 2723 states and 4296 transitions. [2025-03-16 19:09:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 19:09:03,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:03,609 INFO L225 Difference]: With dead ends: 2723 [2025-03-16 19:09:03,609 INFO L226 Difference]: Without dead ends: 1793 [2025-03-16 19:09:03,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:03,611 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 75 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:03,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 267 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-16 19:09:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1775. [2025-03-16 19:09:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1774 states have (on average 1.5591882750845547) internal successors, (2766), 1774 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2766 transitions. [2025-03-16 19:09:03,658 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2766 transitions. Word has length 76 [2025-03-16 19:09:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:03,658 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2766 transitions. [2025-03-16 19:09:03,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2766 transitions. [2025-03-16 19:09:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:09:03,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:03,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:03,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:09:03,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:03,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash -953914755, now seen corresponding path program 1 times [2025-03-16 19:09:03,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799102197] [2025-03-16 19:09:03,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:03,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:09:03,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:09:03,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:03,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:03,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799102197] [2025-03-16 19:09:03,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799102197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:03,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:03,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650538629] [2025-03-16 19:09:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:03,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:03,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:03,737 INFO L87 Difference]: Start difference. First operand 1775 states and 2766 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:03,796 INFO L93 Difference]: Finished difference Result 4979 states and 7760 transitions. [2025-03-16 19:09:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:03,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-16 19:09:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:03,807 INFO L225 Difference]: With dead ends: 4979 [2025-03-16 19:09:03,807 INFO L226 Difference]: Without dead ends: 3249 [2025-03-16 19:09:03,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:03,816 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 95 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:03,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 343 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2025-03-16 19:09:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3247. [2025-03-16 19:09:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 3246 states have (on average 1.5422057917436844) internal successors, (5006), 3246 states have internal predecessors, (5006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 5006 transitions. [2025-03-16 19:09:03,909 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 5006 transitions. Word has length 77 [2025-03-16 19:09:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:03,909 INFO L471 AbstractCegarLoop]: Abstraction has 3247 states and 5006 transitions. [2025-03-16 19:09:03,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 5006 transitions. [2025-03-16 19:09:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:09:03,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:03,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:03,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:09:03,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:03,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash -991516496, now seen corresponding path program 1 times [2025-03-16 19:09:03,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:03,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773371486] [2025-03-16 19:09:03,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:03,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:03,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:09:03,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:09:03,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:03,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:03,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:03,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773371486] [2025-03-16 19:09:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773371486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:03,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:03,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:03,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272587299] [2025-03-16 19:09:03,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:03,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:03,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:03,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:03,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:03,963 INFO L87 Difference]: Start difference. First operand 3247 states and 5006 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:04,061 INFO L93 Difference]: Finished difference Result 9139 states and 14032 transitions. [2025-03-16 19:09:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:04,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-16 19:09:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:04,082 INFO L225 Difference]: With dead ends: 9139 [2025-03-16 19:09:04,082 INFO L226 Difference]: Without dead ends: 5937 [2025-03-16 19:09:04,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:04,087 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 99 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:04,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 356 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5937 states. [2025-03-16 19:09:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5937 to 5935. [2025-03-16 19:09:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5935 states, 5934 states have (on average 1.5176946410515673) internal successors, (9006), 5934 states have internal predecessors, (9006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 9006 transitions. [2025-03-16 19:09:04,235 INFO L78 Accepts]: Start accepts. Automaton has 5935 states and 9006 transitions. Word has length 77 [2025-03-16 19:09:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:04,235 INFO L471 AbstractCegarLoop]: Abstraction has 5935 states and 9006 transitions. [2025-03-16 19:09:04,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5935 states and 9006 transitions. [2025-03-16 19:09:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:09:04,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:04,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:04,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:09:04,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:04,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 729828766, now seen corresponding path program 1 times [2025-03-16 19:09:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:04,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769960317] [2025-03-16 19:09:04,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:04,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:09:04,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:09:04,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:04,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:04,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769960317] [2025-03-16 19:09:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769960317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:04,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:04,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382207864] [2025-03-16 19:09:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:04,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:04,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:04,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:04,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:04,305 INFO L87 Difference]: Start difference. First operand 5935 states and 9006 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:04,403 INFO L93 Difference]: Finished difference Result 11766 states and 17972 transitions. [2025-03-16 19:09:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:04,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 19:09:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:04,430 INFO L225 Difference]: With dead ends: 11766 [2025-03-16 19:09:04,430 INFO L226 Difference]: Without dead ends: 8563 [2025-03-16 19:09:04,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:04,436 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 100 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:04,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 367 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2025-03-16 19:09:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 8561. [2025-03-16 19:09:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8561 states, 8560 states have (on average 1.5121495327102803) internal successors, (12944), 8560 states have internal predecessors, (12944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8561 states to 8561 states and 12944 transitions. [2025-03-16 19:09:04,646 INFO L78 Accepts]: Start accepts. Automaton has 8561 states and 12944 transitions. Word has length 78 [2025-03-16 19:09:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:04,647 INFO L471 AbstractCegarLoop]: Abstraction has 8561 states and 12944 transitions. [2025-03-16 19:09:04,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8561 states and 12944 transitions. [2025-03-16 19:09:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:04,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:04,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:04,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:09:04,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:04,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash 537601106, now seen corresponding path program 1 times [2025-03-16 19:09:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356383488] [2025-03-16 19:09:04,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:04,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:04,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:04,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:04,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:09:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:04,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356383488] [2025-03-16 19:09:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356383488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:04,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467408131] [2025-03-16 19:09:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:04,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:04,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:04,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:04,853 INFO L87 Difference]: Start difference. First operand 8561 states and 12944 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:05,332 INFO L93 Difference]: Finished difference Result 32863 states and 50247 transitions. [2025-03-16 19:09:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:09:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:05,384 INFO L225 Difference]: With dead ends: 32863 [2025-03-16 19:09:05,385 INFO L226 Difference]: Without dead ends: 28573 [2025-03-16 19:09:05,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:05,393 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 1424 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:05,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 1274 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28573 states. [2025-03-16 19:09:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28573 to 12785. [2025-03-16 19:09:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12785 states, 12784 states have (on average 1.5118898623279098) internal successors, (19328), 12784 states have internal predecessors, (19328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12785 states to 12785 states and 19328 transitions. [2025-03-16 19:09:05,805 INFO L78 Accepts]: Start accepts. Automaton has 12785 states and 19328 transitions. Word has length 107 [2025-03-16 19:09:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:05,806 INFO L471 AbstractCegarLoop]: Abstraction has 12785 states and 19328 transitions. [2025-03-16 19:09:05,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12785 states and 19328 transitions. [2025-03-16 19:09:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:05,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:05,811 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:05,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:09:05,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:05,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:05,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1318701541, now seen corresponding path program 1 times [2025-03-16 19:09:05,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099484451] [2025-03-16 19:09:05,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:05,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:05,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:05,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:05,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 19:09:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099484451] [2025-03-16 19:09:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099484451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959088309] [2025-03-16 19:09:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:05,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:05,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:05,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:05,982 INFO L87 Difference]: Start difference. First operand 12785 states and 19328 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:06,526 INFO L93 Difference]: Finished difference Result 37087 states and 56631 transitions. [2025-03-16 19:09:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:06,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:09:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:06,592 INFO L225 Difference]: With dead ends: 37087 [2025-03-16 19:09:06,592 INFO L226 Difference]: Without dead ends: 32797 [2025-03-16 19:09:06,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:06,604 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1531 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:06,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 1218 Invalid, 87 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32797 states. [2025-03-16 19:09:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32797 to 17009. [2025-03-16 19:09:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17009 states, 17008 states have (on average 1.5117591721542802) internal successors, (25712), 17008 states have internal predecessors, (25712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17009 states to 17009 states and 25712 transitions. [2025-03-16 19:09:07,147 INFO L78 Accepts]: Start accepts. Automaton has 17009 states and 25712 transitions. Word has length 107 [2025-03-16 19:09:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:07,147 INFO L471 AbstractCegarLoop]: Abstraction has 17009 states and 25712 transitions. [2025-03-16 19:09:07,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:07,147 INFO L276 IsEmpty]: Start isEmpty. Operand 17009 states and 25712 transitions. [2025-03-16 19:09:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:07,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:07,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:07,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:09:07,154 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:07,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 128463096, now seen corresponding path program 1 times [2025-03-16 19:09:07,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:07,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458424926] [2025-03-16 19:09:07,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:07,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:07,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:07,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:07,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 19:09:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458424926] [2025-03-16 19:09:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458424926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:07,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:07,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420098479] [2025-03-16 19:09:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:07,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:07,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:07,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:07,423 INFO L87 Difference]: Start difference. First operand 17009 states and 25712 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:07,831 INFO L93 Difference]: Finished difference Result 41311 states and 63015 transitions. [2025-03-16 19:09:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:09:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:07,898 INFO L225 Difference]: With dead ends: 41311 [2025-03-16 19:09:07,899 INFO L226 Difference]: Without dead ends: 37021 [2025-03-16 19:09:07,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:07,920 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1383 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:07,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 1323 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37021 states. [2025-03-16 19:09:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37021 to 21233. [2025-03-16 19:09:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21233 states, 21232 states have (on average 1.5116804822908816) internal successors, (32096), 21232 states have internal predecessors, (32096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21233 states to 21233 states and 32096 transitions. [2025-03-16 19:09:08,383 INFO L78 Accepts]: Start accepts. Automaton has 21233 states and 32096 transitions. Word has length 107 [2025-03-16 19:09:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:08,383 INFO L471 AbstractCegarLoop]: Abstraction has 21233 states and 32096 transitions. [2025-03-16 19:09:08,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 21233 states and 32096 transitions. [2025-03-16 19:09:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:08,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:08,389 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:09:08,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:09:08,389 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:08,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:08,389 INFO L85 PathProgramCache]: Analyzing trace with hash -57990702, now seen corresponding path program 1 times [2025-03-16 19:09:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:08,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619211764] [2025-03-16 19:09:08,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:08,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:08,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:08,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:08,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:09:08,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619211764] [2025-03-16 19:09:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619211764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:08,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:08,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91251945] [2025-03-16 19:09:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:08,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:08,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:08,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:08,590 INFO L87 Difference]: Start difference. First operand 21233 states and 32096 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:09,072 INFO L93 Difference]: Finished difference Result 45535 states and 69399 transitions. [2025-03-16 19:09:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:09,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:09:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:09,146 INFO L225 Difference]: With dead ends: 45535 [2025-03-16 19:09:09,146 INFO L226 Difference]: Without dead ends: 41245 [2025-03-16 19:09:09,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:09,158 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1238 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:09,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1545 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41245 states. [2025-03-16 19:09:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41245 to 25457. [2025-03-16 19:09:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25457 states, 25456 states have (on average 1.5116279069767442) internal successors, (38480), 25456 states have internal predecessors, (38480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25457 states to 25457 states and 38480 transitions. [2025-03-16 19:09:09,860 INFO L78 Accepts]: Start accepts. Automaton has 25457 states and 38480 transitions. Word has length 107 [2025-03-16 19:09:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:09,861 INFO L471 AbstractCegarLoop]: Abstraction has 25457 states and 38480 transitions. [2025-03-16 19:09:09,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 25457 states and 38480 transitions. [2025-03-16 19:09:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:09,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:09,868 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:09:09,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:09:09,869 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:09,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash -95592443, now seen corresponding path program 1 times [2025-03-16 19:09:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626267163] [2025-03-16 19:09:09,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:09,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:09,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:09,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:09,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:09:10,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626267163] [2025-03-16 19:09:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626267163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:10,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:10,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456405593] [2025-03-16 19:09:10,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:10,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:10,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:10,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:10,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:10,052 INFO L87 Difference]: Start difference. First operand 25457 states and 38480 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:10,702 INFO L93 Difference]: Finished difference Result 49759 states and 75783 transitions. [2025-03-16 19:09:10,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:10,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:09:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:10,765 INFO L225 Difference]: With dead ends: 49759 [2025-03-16 19:09:10,765 INFO L226 Difference]: Without dead ends: 45469 [2025-03-16 19:09:10,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:10,780 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1279 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:10,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 1486 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45469 states. [2025-03-16 19:09:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45469 to 29681. [2025-03-16 19:09:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29681 states, 29680 states have (on average 1.5115902964959569) internal successors, (44864), 29680 states have internal predecessors, (44864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29681 states to 29681 states and 44864 transitions. [2025-03-16 19:09:11,464 INFO L78 Accepts]: Start accepts. Automaton has 29681 states and 44864 transitions. Word has length 107 [2025-03-16 19:09:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 29681 states and 44864 transitions. [2025-03-16 19:09:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 29681 states and 44864 transitions. [2025-03-16 19:09:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:09:11,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:11,472 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:09:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:09:11,473 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1452511209, now seen corresponding path program 1 times [2025-03-16 19:09:11,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:11,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236786526] [2025-03-16 19:09:11,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:11,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:09:11,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:09:11,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:11,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:11,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236786526] [2025-03-16 19:09:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236786526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:11,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:11,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718874839] [2025-03-16 19:09:11,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:11,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:11,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:11,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:11,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:11,564 INFO L87 Difference]: Start difference. First operand 29681 states and 44864 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:11,850 INFO L93 Difference]: Finished difference Result 59317 states and 89682 transitions. [2025-03-16 19:09:11,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:11,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 19:09:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:11,890 INFO L225 Difference]: With dead ends: 59317 [2025-03-16 19:09:11,890 INFO L226 Difference]: Without dead ends: 29683 [2025-03-16 19:09:11,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:11,918 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 79 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:11,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 357 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29683 states. [2025-03-16 19:09:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29683 to 29681. [2025-03-16 19:09:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29681 states, 29680 states have (on average 1.5002695417789758) internal successors, (44528), 29680 states have internal predecessors, (44528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29681 states to 29681 states and 44528 transitions. [2025-03-16 19:09:12,521 INFO L78 Accepts]: Start accepts. Automaton has 29681 states and 44528 transitions. Word has length 108 [2025-03-16 19:09:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:12,521 INFO L471 AbstractCegarLoop]: Abstraction has 29681 states and 44528 transitions. [2025-03-16 19:09:12,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 29681 states and 44528 transitions. [2025-03-16 19:09:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:09:12,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:12,525 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:09:12,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:09:12,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:12,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:12,525 INFO L85 PathProgramCache]: Analyzing trace with hash 968098212, now seen corresponding path program 1 times [2025-03-16 19:09:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:12,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894813118] [2025-03-16 19:09:12,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:12,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:09:12,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:09:12,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:12,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894813118] [2025-03-16 19:09:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894813118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:12,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618640012] [2025-03-16 19:09:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:12,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:12,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:12,610 INFO L87 Difference]: Start difference. First operand 29681 states and 44528 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:12,784 INFO L93 Difference]: Finished difference Result 44501 states and 66770 transitions. [2025-03-16 19:09:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:12,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 19:09:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:12,808 INFO L225 Difference]: With dead ends: 44501 [2025-03-16 19:09:12,808 INFO L226 Difference]: Without dead ends: 14867 [2025-03-16 19:09:12,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:12,827 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 73 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:12,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 338 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14867 states. [2025-03-16 19:09:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14867 to 14865. [2025-03-16 19:09:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14865 states, 14864 states have (on average 1.4881593110871905) internal successors, (22120), 14864 states have internal predecessors, (22120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14865 states to 14865 states and 22120 transitions. [2025-03-16 19:09:13,070 INFO L78 Accepts]: Start accepts. Automaton has 14865 states and 22120 transitions. Word has length 108 [2025-03-16 19:09:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:13,071 INFO L471 AbstractCegarLoop]: Abstraction has 14865 states and 22120 transitions. [2025-03-16 19:09:13,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14865 states and 22120 transitions. [2025-03-16 19:09:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:09:13,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:13,074 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:09:13,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:09:13,074 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:13,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash -529243727, now seen corresponding path program 1 times [2025-03-16 19:09:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:13,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354813890] [2025-03-16 19:09:13,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:13,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:09:13,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:09:13,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:13,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354813890] [2025-03-16 19:09:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354813890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670823228] [2025-03-16 19:09:14,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:14,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:14,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:14,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:09:14,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:09:14,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:09:14,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:14,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 19:09:14,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:14,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:15,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670823228] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:15,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:15,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 8] total 23 [2025-03-16 19:09:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289416170] [2025-03-16 19:09:15,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:15,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:09:15,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:15,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:09:15,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:09:15,570 INFO L87 Difference]: Start difference. First operand 14865 states and 22120 transitions. Second operand has 23 states, 23 states have (on average 13.869565217391305) internal successors, (319), 23 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:38,533 INFO L93 Difference]: Finished difference Result 221317 states and 326574 transitions. [2025-03-16 19:09:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2025-03-16 19:09:38,533 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 13.869565217391305) internal successors, (319), 23 states have internal predecessors, (319), 0 states have call successors, (0), 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 108 [2025-03-16 19:09:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:38,806 INFO L225 Difference]: With dead ends: 221317 [2025-03-16 19:09:38,807 INFO L226 Difference]: Without dead ends: 211123 [2025-03-16 19:09:38,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29311 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=8089, Invalid=57703, Unknown=0, NotChecked=0, Total=65792 [2025-03-16 19:09:38,855 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 7841 mSDsluCounter, 2673 mSDsCounter, 0 mSdLazyCounter, 3183 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7841 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 3327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:38,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7841 Valid, 2879 Invalid, 3327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3183 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 19:09:38,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211123 states. [2025-03-16 19:09:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211123 to 170645. [2025-03-16 19:09:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170645 states, 170644 states have (on average 1.4592484939406014) internal successors, (249012), 170644 states have internal predecessors, (249012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170645 states to 170645 states and 249012 transitions. [2025-03-16 19:09:43,679 INFO L78 Accepts]: Start accepts. Automaton has 170645 states and 249012 transitions. Word has length 108 [2025-03-16 19:09:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:43,679 INFO L471 AbstractCegarLoop]: Abstraction has 170645 states and 249012 transitions. [2025-03-16 19:09:43,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 13.869565217391305) internal successors, (319), 23 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 170645 states and 249012 transitions. [2025-03-16 19:09:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:09:43,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:43,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:43,690 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-16 19:09:43,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:43,883 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:43,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash 665576533, now seen corresponding path program 1 times [2025-03-16 19:09:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:43,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020916424] [2025-03-16 19:09:43,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:43,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:43,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:09:43,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:09:43,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:43,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:44,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020916424] [2025-03-16 19:09:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020916424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364066116] [2025-03-16 19:09:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:44,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:44,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:44,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:44,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:44,058 INFO L87 Difference]: Start difference. First operand 170645 states and 249012 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:50,218 INFO L93 Difference]: Finished difference Result 313991 states and 461261 transitions. [2025-03-16 19:09:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:50,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:09:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:50,691 INFO L225 Difference]: With dead ends: 313991 [2025-03-16 19:09:50,691 INFO L226 Difference]: Without dead ends: 291837 [2025-03-16 19:09:50,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:50,729 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 1156 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:50,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 2066 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291837 states.