./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label10.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 a24fec5150e44d80cd66a293e62312c173f941d5643050e415eb72b0805f56eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:49:49,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:49:49,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:49:49,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:49:49,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:49:49,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:49:49,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:49:49,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:49:49,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:49:49,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:49:49,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:49:49,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:49:49,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:49:49,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:49:49,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:49:49,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:49:49,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:49:49,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:49:49,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:49:49,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:49:49,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:49:49,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:49:49,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:49:49,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:49:49,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:49:49,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:49:49,380 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 -> a24fec5150e44d80cd66a293e62312c173f941d5643050e415eb72b0805f56eb [2025-03-03 09:49:49,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:49:49,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:49:49,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:49:49,622 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:49:49,623 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:49:49,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label10.c [2025-03-03 09:49:50,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f783d8be0/2376a890a67b4a22aa8c2751964a18ae/FLAG580a1cdf1 [2025-03-03 09:49:51,206 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:49:51,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label10.c [2025-03-03 09:49:51,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f783d8be0/2376a890a67b4a22aa8c2751964a18ae/FLAG580a1cdf1 [2025-03-03 09:49:51,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f783d8be0/2376a890a67b4a22aa8c2751964a18ae [2025-03-03 09:49:51,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:49:51,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:49:51,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:49:51,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:49:51,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:49:51,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:51" (1/1) ... [2025-03-03 09:49:51,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488f8da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:51, skipping insertion in model container [2025-03-03 09:49:51,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:51" (1/1) ... [2025-03-03 09:49:51,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:49:51,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label10.c[58665,58678] [2025-03-03 09:49:51,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:49:51,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:49:51,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label10.c[58665,58678] [2025-03-03 09:49:52,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:49:52,023 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:49:52,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52 WrapperNode [2025-03-03 09:49:52,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:49:52,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:49:52,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:49:52,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:49:52,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,103 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-03 09:49:52,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:49:52,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:49:52,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:49:52,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:49:52,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,153 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:49:52,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:49:52,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:49:52,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:49:52,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:49:52,229 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (1/1) ... [2025-03-03 09:49:52,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:49:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:49:52,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:49:52,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:49:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:49:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:49:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:49:52,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:49:52,372 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:49:52,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:49:53,813 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 09:49:53,813 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:49:53,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:49:53,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:49:53,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:53 BoogieIcfgContainer [2025-03-03 09:49:53,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:49:53,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:49:53,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:49:53,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:49:53,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:49:51" (1/3) ... [2025-03-03 09:49:53,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ba3c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:53, skipping insertion in model container [2025-03-03 09:49:53,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:52" (2/3) ... [2025-03-03 09:49:53,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ba3c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:53, skipping insertion in model container [2025-03-03 09:49:53,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:53" (3/3) ... [2025-03-03 09:49:53,838 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label10.c [2025-03-03 09:49:53,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:49:53,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label10.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:49:53,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:49:53,914 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;@6843cf08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:49:53,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:49:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 09:49:53,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:53,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:53,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:53,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash -331228559, now seen corresponding path program 1 times [2025-03-03 09:49:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045209363] [2025-03-03 09:49:53,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:54,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 09:49:54,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 09:49:54,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:54,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045209363] [2025-03-03 09:49:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045209363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:54,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:54,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418880425] [2025-03-03 09:49:54,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:54,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:54,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:54,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:54,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:54,692 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:55,578 INFO L93 Difference]: Finished difference Result 855 states and 1493 transitions. [2025-03-03 09:49:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:55,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-03-03 09:49:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:55,592 INFO L225 Difference]: With dead ends: 855 [2025-03-03 09:49:55,593 INFO L226 Difference]: Without dead ends: 460 [2025-03-03 09:49:55,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:55,599 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 115 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:55,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 175 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:49:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-03 09:49:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2025-03-03 09:49:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2025-03-03 09:49:55,650 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 181 [2025-03-03 09:49:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:55,651 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2025-03-03 09:49:55,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2025-03-03 09:49:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 09:49:55,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:55,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:55,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:49:55,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:55,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1391274183, now seen corresponding path program 1 times [2025-03-03 09:49:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736475904] [2025-03-03 09:49:55,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:55,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:55,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 09:49:55,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 09:49:55,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:55,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736475904] [2025-03-03 09:49:55,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736475904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:55,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:55,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196003749] [2025-03-03 09:49:55,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:55,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:55,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:55,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:55,967 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:56,204 INFO L93 Difference]: Finished difference Result 1372 states and 2125 transitions. [2025-03-03 09:49:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2025-03-03 09:49:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:56,208 INFO L225 Difference]: With dead ends: 1372 [2025-03-03 09:49:56,208 INFO L226 Difference]: Without dead ends: 915 [2025-03-03 09:49:56,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:56,210 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:56,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:49:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-03 09:49:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2025-03-03 09:49:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.5460526315789473) internal successors, (1410), 912 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1410 transitions. [2025-03-03 09:49:56,245 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1410 transitions. Word has length 186 [2025-03-03 09:49:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:56,246 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1410 transitions. [2025-03-03 09:49:56,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1410 transitions. [2025-03-03 09:49:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 09:49:56,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:56,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:56,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:49:56,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:56,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1248014555, now seen corresponding path program 1 times [2025-03-03 09:49:56,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:56,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230729705] [2025-03-03 09:49:56,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:56,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 09:49:56,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 09:49:56,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:56,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:56,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:56,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230729705] [2025-03-03 09:49:56,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230729705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:56,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:56,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:56,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820829920] [2025-03-03 09:49:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:56,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:56,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:56,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:56,371 INFO L87 Difference]: Start difference. First operand 913 states and 1410 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:57,059 INFO L93 Difference]: Finished difference Result 2685 states and 4171 transitions. [2025-03-03 09:49:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:57,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2025-03-03 09:49:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:57,066 INFO L225 Difference]: With dead ends: 2685 [2025-03-03 09:49:57,066 INFO L226 Difference]: Without dead ends: 1774 [2025-03-03 09:49:57,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:57,068 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 236 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:57,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 154 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:49:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-03-03 09:49:57,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1738. [2025-03-03 09:49:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 1.5135290731145654) internal successors, (2629), 1737 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2629 transitions. [2025-03-03 09:49:57,111 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2629 transitions. Word has length 189 [2025-03-03 09:49:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:57,111 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2629 transitions. [2025-03-03 09:49:57,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2629 transitions. [2025-03-03 09:49:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 09:49:57,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:57,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:57,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:49:57,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:57,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash 269606538, now seen corresponding path program 1 times [2025-03-03 09:49:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:57,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723841012] [2025-03-03 09:49:57,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:57,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:57,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 09:49:57,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 09:49:57,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:57,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:57,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:57,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723841012] [2025-03-03 09:49:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723841012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:57,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487020625] [2025-03-03 09:49:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:57,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:57,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:57,258 INFO L87 Difference]: Start difference. First operand 1738 states and 2629 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:57,551 INFO L93 Difference]: Finished difference Result 5178 states and 7843 transitions. [2025-03-03 09:49:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:57,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2025-03-03 09:49:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:57,562 INFO L225 Difference]: With dead ends: 5178 [2025-03-03 09:49:57,562 INFO L226 Difference]: Without dead ends: 3442 [2025-03-03 09:49:57,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:57,565 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 349 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:57,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 513 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:49:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-03-03 09:49:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3438. [2025-03-03 09:49:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3437 states have (on average 1.5074192609834158) internal successors, (5181), 3437 states have internal predecessors, (5181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 5181 transitions. [2025-03-03 09:49:57,629 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 5181 transitions. Word has length 195 [2025-03-03 09:49:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:57,629 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 5181 transitions. [2025-03-03 09:49:57,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 5181 transitions. [2025-03-03 09:49:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 09:49:57,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:57,635 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:57,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:49:57,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:57,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2140088872, now seen corresponding path program 1 times [2025-03-03 09:49:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:57,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192840722] [2025-03-03 09:49:57,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:57,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 09:49:57,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 09:49:57,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:57,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:49:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:57,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192840722] [2025-03-03 09:49:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192840722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:49:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114035090] [2025-03-03 09:49:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:57,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:57,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:57,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:57,916 INFO L87 Difference]: Start difference. First operand 3438 states and 5181 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:58,617 INFO L93 Difference]: Finished difference Result 8539 states and 12821 transitions. [2025-03-03 09:49:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 196 [2025-03-03 09:49:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:58,634 INFO L225 Difference]: With dead ends: 8539 [2025-03-03 09:49:58,634 INFO L226 Difference]: Without dead ends: 5103 [2025-03-03 09:49:58,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:58,638 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 234 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:58,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 114 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:49:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5103 states. [2025-03-03 09:49:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5103 to 5099. [2025-03-03 09:49:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 5098 states have (on average 1.4731267163593567) internal successors, (7510), 5098 states have internal predecessors, (7510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 7510 transitions. [2025-03-03 09:49:58,731 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 7510 transitions. Word has length 196 [2025-03-03 09:49:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:58,731 INFO L471 AbstractCegarLoop]: Abstraction has 5099 states and 7510 transitions. [2025-03-03 09:49:58,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 7510 transitions. [2025-03-03 09:49:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:49:58,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:58,738 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:58,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:49:58,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:58,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash 221620509, now seen corresponding path program 1 times [2025-03-03 09:49:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376651119] [2025-03-03 09:49:58,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:58,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:58,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:49:58,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:49:58,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:58,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:49:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376651119] [2025-03-03 09:49:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376651119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:49:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:49:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15456535] [2025-03-03 09:49:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:58,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:58,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:58,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:58,854 INFO L87 Difference]: Start difference. First operand 5099 states and 7510 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:49:59,170 INFO L93 Difference]: Finished difference Result 15193 states and 22394 transitions. [2025-03-03 09:49:59,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:49:59,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-03-03 09:49:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:49:59,204 INFO L225 Difference]: With dead ends: 15193 [2025-03-03 09:49:59,204 INFO L226 Difference]: Without dead ends: 10096 [2025-03-03 09:49:59,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:49:59,211 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 359 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:49:59,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 585 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:49:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10096 states. [2025-03-03 09:49:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10096 to 10090. [2025-03-03 09:49:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10090 states, 10089 states have (on average 1.473386856972941) internal successors, (14865), 10089 states have internal predecessors, (14865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10090 states to 10090 states and 14865 transitions. [2025-03-03 09:49:59,390 INFO L78 Accepts]: Start accepts. Automaton has 10090 states and 14865 transitions. Word has length 203 [2025-03-03 09:49:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:49:59,391 INFO L471 AbstractCegarLoop]: Abstraction has 10090 states and 14865 transitions. [2025-03-03 09:49:59,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:49:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 10090 states and 14865 transitions. [2025-03-03 09:49:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:49:59,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:49:59,404 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:49:59,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:49:59,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:49:59,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:49:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash 641652583, now seen corresponding path program 1 times [2025-03-03 09:49:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:49:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640276724] [2025-03-03 09:49:59,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:49:59,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:49:59,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:49:59,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:59,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:49:59,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:49:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640276724] [2025-03-03 09:49:59,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640276724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:49:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679711031] [2025-03-03 09:49:59,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:49:59,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:49:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:49:59,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:49:59,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:49:59,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:49:59,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:49:59,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:49:59,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:49:59,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:49:59,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:49:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:49:59,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:49:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679711031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:49:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:49:59,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:49:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878180969] [2025-03-03 09:49:59,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:49:59,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:49:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:49:59,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:49:59,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:49:59,810 INFO L87 Difference]: Start difference. First operand 10090 states and 14865 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:00,616 INFO L93 Difference]: Finished difference Result 29938 states and 44140 transitions. [2025-03-03 09:50:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-03-03 09:50:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:00,665 INFO L225 Difference]: With dead ends: 29938 [2025-03-03 09:50:00,666 INFO L226 Difference]: Without dead ends: 19850 [2025-03-03 09:50:00,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:00,683 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 224 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:00,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 428 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:50:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2025-03-03 09:50:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 19834. [2025-03-03 09:50:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19834 states, 19833 states have (on average 1.3029294609993445) internal successors, (25841), 19833 states have internal predecessors, (25841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 25841 transitions. [2025-03-03 09:50:01,079 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 25841 transitions. Word has length 203 [2025-03-03 09:50:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:01,080 INFO L471 AbstractCegarLoop]: Abstraction has 19834 states and 25841 transitions. [2025-03-03 09:50:01,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 25841 transitions. [2025-03-03 09:50:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:50:01,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:01,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:01,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:50:01,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:01,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:01,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1082465411, now seen corresponding path program 1 times [2025-03-03 09:50:01,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:01,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435688727] [2025-03-03 09:50:01,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:01,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:50:01,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:50:01,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:01,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:50:01,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:01,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435688727] [2025-03-03 09:50:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435688727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:01,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662260877] [2025-03-03 09:50:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:01,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:01,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:01,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:01,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:01,469 INFO L87 Difference]: Start difference. First operand 19834 states and 25841 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:02,223 INFO L93 Difference]: Finished difference Result 59230 states and 77149 transitions. [2025-03-03 09:50:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:02,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-03-03 09:50:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:02,366 INFO L225 Difference]: With dead ends: 59230 [2025-03-03 09:50:02,367 INFO L226 Difference]: Without dead ends: 39398 [2025-03-03 09:50:02,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:02,387 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 241 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:02,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 163 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39398 states. [2025-03-03 09:50:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39398 to 39380. [2025-03-03 09:50:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39380 states, 39379 states have (on average 1.2551105919398664) internal successors, (49425), 39379 states have internal predecessors, (49425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39380 states to 39380 states and 49425 transitions. [2025-03-03 09:50:02,997 INFO L78 Accepts]: Start accepts. Automaton has 39380 states and 49425 transitions. Word has length 203 [2025-03-03 09:50:02,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:02,997 INFO L471 AbstractCegarLoop]: Abstraction has 39380 states and 49425 transitions. [2025-03-03 09:50:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 39380 states and 49425 transitions. [2025-03-03 09:50:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 09:50:03,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:03,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:50:03,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:03,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash 615212815, now seen corresponding path program 1 times [2025-03-03 09:50:03,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:03,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721880299] [2025-03-03 09:50:03,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:03,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 09:50:03,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 09:50:03,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:03,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721880299] [2025-03-03 09:50:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721880299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354196651] [2025-03-03 09:50:03,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:03,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:03,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:03,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:50:04,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 09:50:04,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 09:50:04,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:04,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:04,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:50:04,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:50:04,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354196651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:04,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:04,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:50:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805714391] [2025-03-03 09:50:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:04,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:04,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:04,311 INFO L87 Difference]: Start difference. First operand 39380 states and 49425 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:05,324 INFO L93 Difference]: Finished difference Result 110568 states and 138750 transitions. [2025-03-03 09:50:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:05,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2025-03-03 09:50:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:05,453 INFO L225 Difference]: With dead ends: 110568 [2025-03-03 09:50:05,453 INFO L226 Difference]: Without dead ends: 71190 [2025-03-03 09:50:05,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:05,481 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 63 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:05,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 428 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71190 states. [2025-03-03 09:50:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71190 to 71048. [2025-03-03 09:50:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71048 states, 71047 states have (on average 1.2344082086506116) internal successors, (87701), 71047 states have internal predecessors, (87701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71048 states to 71048 states and 87701 transitions. [2025-03-03 09:50:06,371 INFO L78 Accepts]: Start accepts. Automaton has 71048 states and 87701 transitions. Word has length 219 [2025-03-03 09:50:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:06,372 INFO L471 AbstractCegarLoop]: Abstraction has 71048 states and 87701 transitions. [2025-03-03 09:50:06,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 71048 states and 87701 transitions. [2025-03-03 09:50:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 09:50:06,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:06,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:06,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:50:06,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 09:50:06,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:06,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1733919435, now seen corresponding path program 1 times [2025-03-03 09:50:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857654115] [2025-03-03 09:50:06,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:06,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 09:50:06,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 09:50:06,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:06,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857654115] [2025-03-03 09:50:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857654115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334837540] [2025-03-03 09:50:07,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:07,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:07,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:07,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:50:07,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 09:50:07,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 09:50:07,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:07,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:07,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:50:07,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:50:07,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:07,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334837540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:07,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:07,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:50:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12598703] [2025-03-03 09:50:07,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:07,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:07,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:07,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:07,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:07,525 INFO L87 Difference]: Start difference. First operand 71048 states and 87701 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:08,635 INFO L93 Difference]: Finished difference Result 142110 states and 175428 transitions. [2025-03-03 09:50:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:08,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 229 [2025-03-03 09:50:08,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:08,753 INFO L225 Difference]: With dead ends: 142110 [2025-03-03 09:50:08,753 INFO L226 Difference]: Without dead ends: 71064 [2025-03-03 09:50:08,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:08,798 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:08,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 99 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71064 states. [2025-03-03 09:50:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71064 to 71048. [2025-03-03 09:50:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71048 states, 71047 states have (on average 1.2260756963700086) internal successors, (87109), 71047 states have internal predecessors, (87109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71048 states to 71048 states and 87109 transitions. [2025-03-03 09:50:09,651 INFO L78 Accepts]: Start accepts. Automaton has 71048 states and 87109 transitions. Word has length 229 [2025-03-03 09:50:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:09,651 INFO L471 AbstractCegarLoop]: Abstraction has 71048 states and 87109 transitions. [2025-03-03 09:50:09,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 71048 states and 87109 transitions. [2025-03-03 09:50:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 09:50:09,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:09,681 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:09,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:50:09,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:09,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:09,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash -239687427, now seen corresponding path program 1 times [2025-03-03 09:50:09,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:09,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73005834] [2025-03-03 09:50:09,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:09,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:09,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 09:50:09,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 09:50:09,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:09,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:50:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73005834] [2025-03-03 09:50:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73005834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121925067] [2025-03-03 09:50:10,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:10,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:10,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:10,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:50:10,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 09:50:10,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 09:50:10,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:10,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:10,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:50:10,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:50:10,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121925067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 09:50:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531443129] [2025-03-03 09:50:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:10,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:10,819 INFO L87 Difference]: Start difference. First operand 71048 states and 87109 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:11,325 INFO L93 Difference]: Finished difference Result 139683 states and 171455 transitions. [2025-03-03 09:50:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:11,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 09:50:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:11,417 INFO L225 Difference]: With dead ends: 139683 [2025-03-03 09:50:11,417 INFO L226 Difference]: Without dead ends: 68637 [2025-03-03 09:50:11,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:11,469 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:11,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:50:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68637 states. [2025-03-03 09:50:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68637 to 68637. [2025-03-03 09:50:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68637 states, 68636 states have (on average 1.2189230141616645) internal successors, (83662), 68636 states have internal predecessors, (83662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68637 states to 68637 states and 83662 transitions. [2025-03-03 09:50:12,635 INFO L78 Accepts]: Start accepts. Automaton has 68637 states and 83662 transitions. Word has length 232 [2025-03-03 09:50:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:12,635 INFO L471 AbstractCegarLoop]: Abstraction has 68637 states and 83662 transitions. [2025-03-03 09:50:12,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 68637 states and 83662 transitions. [2025-03-03 09:50:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-03 09:50:12,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:12,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:12,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:50:12,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:12,878 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:12,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash 562654068, now seen corresponding path program 1 times [2025-03-03 09:50:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417851779] [2025-03-03 09:50:12,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:12,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-03 09:50:12,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-03 09:50:12,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:12,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 09:50:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417851779] [2025-03-03 09:50:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417851779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:13,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:13,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:13,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523111051] [2025-03-03 09:50:13,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:13,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:13,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:13,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:13,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:13,116 INFO L87 Difference]: Start difference. First operand 68637 states and 83662 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:14,084 INFO L93 Difference]: Finished difference Result 163661 states and 203245 transitions. [2025-03-03 09:50:14,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:14,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 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 286 [2025-03-03 09:50:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:14,229 INFO L225 Difference]: With dead ends: 163661 [2025-03-03 09:50:14,229 INFO L226 Difference]: Without dead ends: 95026 [2025-03-03 09:50:14,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:14,291 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 172 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:14,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 150 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:50:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95026 states. [2025-03-03 09:50:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95026 to 95026. [2025-03-03 09:50:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95026 states, 95025 states have (on average 1.179973691133912) internal successors, (112127), 95025 states have internal predecessors, (112127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95026 states to 95026 states and 112127 transitions. [2025-03-03 09:50:15,737 INFO L78 Accepts]: Start accepts. Automaton has 95026 states and 112127 transitions. Word has length 286 [2025-03-03 09:50:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 95026 states and 112127 transitions. [2025-03-03 09:50:15,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 95026 states and 112127 transitions. [2025-03-03 09:50:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-03 09:50:15,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:15,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:50:15,776 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash -344084728, now seen corresponding path program 1 times [2025-03-03 09:50:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970060276] [2025-03-03 09:50:15,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:15,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-03 09:50:15,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-03 09:50:15,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:15,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 09:50:16,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:16,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970060276] [2025-03-03 09:50:16,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970060276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:16,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:16,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489534692] [2025-03-03 09:50:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:16,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:16,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:16,011 INFO L87 Difference]: Start difference. First operand 95026 states and 112127 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:17,689 INFO L93 Difference]: Finished difference Result 236688 states and 279208 transitions. [2025-03-03 09:50:17,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:17,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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 317 [2025-03-03 09:50:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:17,856 INFO L225 Difference]: With dead ends: 236688 [2025-03-03 09:50:17,856 INFO L226 Difference]: Without dead ends: 141664 [2025-03-03 09:50:17,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:17,890 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 157 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:17,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 150 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:50:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141664 states. [2025-03-03 09:50:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141664 to 141660. [2025-03-03 09:50:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141660 states, 141659 states have (on average 1.1778143287754397) internal successors, (166848), 141659 states have internal predecessors, (166848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141660 states to 141660 states and 166848 transitions. [2025-03-03 09:50:19,643 INFO L78 Accepts]: Start accepts. Automaton has 141660 states and 166848 transitions. Word has length 317 [2025-03-03 09:50:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:19,643 INFO L471 AbstractCegarLoop]: Abstraction has 141660 states and 166848 transitions. [2025-03-03 09:50:19,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 141660 states and 166848 transitions. [2025-03-03 09:50:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 09:50:19,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:19,713 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:19,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:50:19,714 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:19,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash 704585571, now seen corresponding path program 1 times [2025-03-03 09:50:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:19,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418265767] [2025-03-03 09:50:19,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:19,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 09:50:19,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 09:50:19,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:19,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 148 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 09:50:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418265767] [2025-03-03 09:50:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418265767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:20,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331309999] [2025-03-03 09:50:20,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:20,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:20,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:20,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:20,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:50:20,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 09:50:21,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 09:50:21,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:21,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:21,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:50:21,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 09:50:21,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331309999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:21,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 09:50:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894698917] [2025-03-03 09:50:21,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:21,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:21,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:21,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:21,163 INFO L87 Difference]: Start difference. First operand 141660 states and 166848 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 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-03 09:50:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:22,612 INFO L93 Difference]: Finished difference Result 380838 states and 449282 transitions. [2025-03-03 09:50:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 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) Word has length 324 [2025-03-03 09:50:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:23,004 INFO L225 Difference]: With dead ends: 380838 [2025-03-03 09:50:23,005 INFO L226 Difference]: Without dead ends: 239180 [2025-03-03 09:50:23,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:23,123 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 178 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:23,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 95 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:50:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239180 states. [2025-03-03 09:50:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239180 to 239132. [2025-03-03 09:50:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239132 states, 239131 states have (on average 1.1603514391693257) internal successors, (277476), 239131 states have internal predecessors, (277476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239132 states to 239132 states and 277476 transitions. [2025-03-03 09:50:26,640 INFO L78 Accepts]: Start accepts. Automaton has 239132 states and 277476 transitions. Word has length 324 [2025-03-03 09:50:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:26,641 INFO L471 AbstractCegarLoop]: Abstraction has 239132 states and 277476 transitions. [2025-03-03 09:50:26,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 2 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-03 09:50:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 239132 states and 277476 transitions. [2025-03-03 09:50:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 09:50:26,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:26,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:27,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:50:27,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:50:27,199 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:27,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -291697307, now seen corresponding path program 1 times [2025-03-03 09:50:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:27,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802861501] [2025-03-03 09:50:27,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:27,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:27,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 09:50:27,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 09:50:27,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:27,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 156 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802861501] [2025-03-03 09:50:27,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802861501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576301220] [2025-03-03 09:50:27,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:27,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:27,478 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:27,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:50:27,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 09:50:27,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 09:50:27,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:27,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:27,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:50:27,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 09:50:27,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:27,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576301220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:27,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:27,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:50:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875779526] [2025-03-03 09:50:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:27,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:27,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:27,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:27,895 INFO L87 Difference]: Start difference. First operand 239132 states and 277476 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:29,475 INFO L93 Difference]: Finished difference Result 449790 states and 520223 transitions. [2025-03-03 09:50:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:29,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 338 [2025-03-03 09:50:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:29,833 INFO L225 Difference]: With dead ends: 449790 [2025-03-03 09:50:29,833 INFO L226 Difference]: Without dead ends: 210660 [2025-03-03 09:50:29,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:29,984 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 69 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:29,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 310 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:50:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210660 states. [2025-03-03 09:50:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210660 to 209004. [2025-03-03 09:50:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209004 states, 209003 states have (on average 1.1181705525758003) internal successors, (233701), 209003 states have internal predecessors, (233701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209004 states to 209004 states and 233701 transitions. [2025-03-03 09:50:33,178 INFO L78 Accepts]: Start accepts. Automaton has 209004 states and 233701 transitions. Word has length 338 [2025-03-03 09:50:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 209004 states and 233701 transitions. [2025-03-03 09:50:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 209004 states and 233701 transitions. [2025-03-03 09:50:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-03 09:50:33,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:33,264 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:33,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:50:33,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:50:33,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:33,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2073326534, now seen corresponding path program 1 times [2025-03-03 09:50:33,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:33,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972816384] [2025-03-03 09:50:33,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:33,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 09:50:33,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 09:50:33,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:33,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 09:50:33,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:33,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972816384] [2025-03-03 09:50:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972816384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:33,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:33,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378938220] [2025-03-03 09:50:33,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:33,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:33,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:33,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:33,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:33,688 INFO L87 Difference]: Start difference. First operand 209004 states and 233701 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:35,295 INFO L93 Difference]: Finished difference Result 380916 states and 425940 transitions. [2025-03-03 09:50:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:35,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 353 [2025-03-03 09:50:35,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:35,299 INFO L225 Difference]: With dead ends: 380916 [2025-03-03 09:50:35,299 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:50:35,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:35,401 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 243 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:35,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 333 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:50:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:50:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:50:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:50:35,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 353 [2025-03-03 09:50:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:50:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:50:35,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:50:35,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:50:35,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 09:50:35,408 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:35,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.