./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label59.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_label59.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 2d68e7262b60a12a6597b15e2848fbc8314c4945758acd933fd69212a55e4a41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:53:18,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:53:18,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:53:18,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:53:18,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:53:18,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:53:18,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:53:18,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:53:18,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:53:18,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:53:18,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:53:18,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:53:18,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:53:18,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:53:18,868 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:53:18,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:53:18,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:53:18,868 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:53:18,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:53:18,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:53:18,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:53:18,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:53:18,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:53:18,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:53:18,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:53:18,870 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:53:18,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:53:18,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:53:18,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:53:18,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:53:18,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:53:18,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:53:18,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:53:18,871 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 -> 2d68e7262b60a12a6597b15e2848fbc8314c4945758acd933fd69212a55e4a41 [2025-03-03 09:53:19,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:53:19,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:53:19,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:53:19,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:53:19,102 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:53:19,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label59.c [2025-03-03 09:53:20,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b37bf9a/a3a431684715441388a36c9ce8976161/FLAG6bf61e361 [2025-03-03 09:53:20,581 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:53:20,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label59.c [2025-03-03 09:53:20,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b37bf9a/a3a431684715441388a36c9ce8976161/FLAG6bf61e361 [2025-03-03 09:53:20,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b37bf9a/a3a431684715441388a36c9ce8976161 [2025-03-03 09:53:20,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:53:20,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:53:20,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:53:20,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:53:20,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:53:20,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:53:20" (1/1) ... [2025-03-03 09:53:20,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:20, skipping insertion in model container [2025-03-03 09:53:20,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:53:20" (1/1) ... [2025-03-03 09:53:20,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:53:21,215 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_label59.c[57711,57724] [2025-03-03 09:53:21,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:53:21,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:53:21,373 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_label59.c[57711,57724] [2025-03-03 09:53:21,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:53:21,400 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:53:21,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21 WrapperNode [2025-03-03 09:53:21,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:53:21,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:53:21,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:53:21,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:53:21,407 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:53:21" (1/1) ... [2025-03-03 09:53:21,436 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:53:21" (1/1) ... [2025-03-03 09:53:21,518 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-03 09:53:21,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:53:21,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:53:21,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:53:21,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:53:21,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,575 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:53:21,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:53:21,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:53:21,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:53:21,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:53:21,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (1/1) ... [2025-03-03 09:53:21,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:53:21,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:21,696 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:53:21,704 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:53:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:53:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:53:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:53:21,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:53:21,789 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:53:21,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:53:23,288 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 09:53:23,288 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:53:23,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:53:23,305 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:53:23,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:53:23 BoogieIcfgContainer [2025-03-03 09:53:23,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:53:23,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:53:23,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:53:23,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:53:23,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:53:20" (1/3) ... [2025-03-03 09:53:23,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3302ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:53:23, skipping insertion in model container [2025-03-03 09:53:23,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:53:21" (2/3) ... [2025-03-03 09:53:23,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3302ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:53:23, skipping insertion in model container [2025-03-03 09:53:23,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:53:23" (3/3) ... [2025-03-03 09:53:23,312 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label59.c [2025-03-03 09:53:23,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:53:23,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label59.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:53:23,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:53:23,381 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;@2f98cd81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:53:23,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:53:23,386 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:53:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 09:53:23,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:23,397 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] [2025-03-03 09:53:23,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash -855673595, now seen corresponding path program 1 times [2025-03-03 09:53:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883311036] [2025-03-03 09:53:23,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:23,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 09:53:23,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 09:53:23,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:23,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:24,128 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:53:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883311036] [2025-03-03 09:53:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883311036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:24,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:24,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680587488] [2025-03-03 09:53:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:24,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:24,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:24,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:24,150 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 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:53:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:24,969 INFO L93 Difference]: Finished difference Result 864 states and 1511 transitions. [2025-03-03 09:53:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-03-03 09:53:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:24,981 INFO L225 Difference]: With dead ends: 864 [2025-03-03 09:53:24,982 INFO L226 Difference]: Without dead ends: 468 [2025-03-03 09:53:24,985 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:53:24,987 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 104 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:24,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 166 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:53:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-03 09:53:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2025-03-03 09:53:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.6269315673289184) internal successors, (737), 453 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:53:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 737 transitions. [2025-03-03 09:53:25,036 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 737 transitions. Word has length 174 [2025-03-03 09:53:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:25,036 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 737 transitions. [2025-03-03 09:53:25,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:53:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 737 transitions. [2025-03-03 09:53:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 09:53:25,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:25,043 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] [2025-03-03 09:53:25,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:53:25,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash 860748655, now seen corresponding path program 1 times [2025-03-03 09:53:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:25,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770607899] [2025-03-03 09:53:25,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:25,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 09:53:25,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 09:53:25,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:25,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:25,312 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:53:25,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770607899] [2025-03-03 09:53:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770607899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:25,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687626] [2025-03-03 09:53:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:25,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:25,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:25,316 INFO L87 Difference]: Start difference. First operand 454 states and 737 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:53:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:25,528 INFO L93 Difference]: Finished difference Result 1358 states and 2207 transitions. [2025-03-03 09:53:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2025-03-03 09:53:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:25,532 INFO L225 Difference]: With dead ends: 1358 [2025-03-03 09:53:25,532 INFO L226 Difference]: Without dead ends: 906 [2025-03-03 09:53:25,533 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:53:25,534 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:53:25,534 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:53:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-03 09:53:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2025-03-03 09:53:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.6223698781838316) internal successors, (1465), 903 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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:53:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1465 transitions. [2025-03-03 09:53:25,563 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1465 transitions. Word has length 179 [2025-03-03 09:53:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:25,563 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1465 transitions. [2025-03-03 09:53:25,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:53:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1465 transitions. [2025-03-03 09:53:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 09:53:25,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:25,569 INFO L218 NwaCegarLoop]: trace histogram [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:53:25,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:53:25,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1365528190, now seen corresponding path program 1 times [2025-03-03 09:53:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378076174] [2025-03-03 09:53:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:25,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 09:53:25,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 09:53:25,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:25,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:25,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:25,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378076174] [2025-03-03 09:53:25,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378076174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:25,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831532210] [2025-03-03 09:53:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:25,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:25,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:25,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:25,825 INFO L87 Difference]: Start difference. First operand 904 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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:53:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:26,475 INFO L93 Difference]: Finished difference Result 2620 states and 4270 transitions. [2025-03-03 09:53:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2025-03-03 09:53:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:26,482 INFO L225 Difference]: With dead ends: 2620 [2025-03-03 09:53:26,483 INFO L226 Difference]: Without dead ends: 1718 [2025-03-03 09:53:26,485 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:53:26,488 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 217 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:26,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 198 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:53:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-03 09:53:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718. [2025-03-03 09:53:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 1.4041933605125219) internal successors, (2411), 1717 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states 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:53:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2411 transitions. [2025-03-03 09:53:26,547 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2411 transitions. Word has length 180 [2025-03-03 09:53:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:26,547 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2411 transitions. [2025-03-03 09:53:26,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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:53:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2411 transitions. [2025-03-03 09:53:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 09:53:26,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:26,552 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] [2025-03-03 09:53:26,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:53:26,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:26,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2025840165, now seen corresponding path program 1 times [2025-03-03 09:53:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563318503] [2025-03-03 09:53:26,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:26,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 09:53:26,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 09:53:26,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:26,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:26,705 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:53:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563318503] [2025-03-03 09:53:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563318503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:26,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:26,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332152218] [2025-03-03 09:53:26,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:26,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:26,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:26,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:26,707 INFO L87 Difference]: Start difference. First operand 1718 states and 2411 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:53:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:27,378 INFO L93 Difference]: Finished difference Result 5089 states and 7163 transitions. [2025-03-03 09:53:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:27,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-03 09:53:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:27,387 INFO L225 Difference]: With dead ends: 5089 [2025-03-03 09:53:27,388 INFO L226 Difference]: Without dead ends: 3373 [2025-03-03 09:53:27,389 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:53:27,392 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:27,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:53:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2025-03-03 09:53:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3345. [2025-03-03 09:53:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3345 states, 3344 states have (on average 1.3785885167464116) internal successors, (4610), 3344 states have internal predecessors, (4610), 0 states have call successors, (0), 0 states 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:53:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 4610 transitions. [2025-03-03 09:53:27,453 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 4610 transitions. Word has length 182 [2025-03-03 09:53:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:27,453 INFO L471 AbstractCegarLoop]: Abstraction has 3345 states and 4610 transitions. [2025-03-03 09:53:27,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:53:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 4610 transitions. [2025-03-03 09:53:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 09:53:27,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:27,461 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:53:27,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:53:27,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:27,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1172529489, now seen corresponding path program 1 times [2025-03-03 09:53:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:27,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057455787] [2025-03-03 09:53:27,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:27,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 09:53:27,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 09:53:27,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:27,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057455787] [2025-03-03 09:53:27,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057455787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:27,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:27,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:27,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343656543] [2025-03-03 09:53:27,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:27,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:27,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:27,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:27,724 INFO L87 Difference]: Start difference. First operand 3345 states and 4610 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:53:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:28,465 INFO L93 Difference]: Finished difference Result 9981 states and 13760 transitions. [2025-03-03 09:53:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:28,466 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:53:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:28,488 INFO L225 Difference]: With dead ends: 9981 [2025-03-03 09:53:28,488 INFO L226 Difference]: Without dead ends: 6638 [2025-03-03 09:53:28,492 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:53:28,493 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:28,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 98 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:53:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-03-03 09:53:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6633. [2025-03-03 09:53:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 1.3525331724969842) internal successors, (8970), 6632 states have internal predecessors, (8970), 0 states have call successors, (0), 0 states 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:53:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 8970 transitions. [2025-03-03 09:53:28,630 INFO L78 Accepts]: Start accepts. Automaton has 6633 states and 8970 transitions. Word has length 186 [2025-03-03 09:53:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:28,630 INFO L471 AbstractCegarLoop]: Abstraction has 6633 states and 8970 transitions. [2025-03-03 09:53:28,631 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:53:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6633 states and 8970 transitions. [2025-03-03 09:53:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 09:53:28,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:28,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:28,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:53:28,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:28,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1917575648, now seen corresponding path program 1 times [2025-03-03 09:53:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323182914] [2025-03-03 09:53:28,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:28,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 09:53:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 09:53:28,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:28,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:53:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:28,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323182914] [2025-03-03 09:53:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323182914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:28,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:28,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923400550] [2025-03-03 09:53:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:28,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:28,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:28,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:28,851 INFO L87 Difference]: Start difference. First operand 6633 states and 8970 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:53:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:29,610 INFO L93 Difference]: Finished difference Result 19782 states and 26760 transitions. [2025-03-03 09:53:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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:53:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:29,648 INFO L225 Difference]: With dead ends: 19782 [2025-03-03 09:53:29,649 INFO L226 Difference]: Without dead ends: 13151 [2025-03-03 09:53:29,659 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:53:29,659 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 91 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:29,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 381 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:53:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-03-03 09:53:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 11517. [2025-03-03 09:53:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11517 states, 11516 states have (on average 1.2955019103855505) internal successors, (14919), 11516 states have internal predecessors, (14919), 0 states have call successors, (0), 0 states 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:53:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 14919 transitions. [2025-03-03 09:53:29,909 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 14919 transitions. Word has length 189 [2025-03-03 09:53:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:29,911 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 14919 transitions. [2025-03-03 09:53:29,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:53:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 14919 transitions. [2025-03-03 09:53:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 09:53:29,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:29,922 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:53:29,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:53:29,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:29,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 809075034, now seen corresponding path program 1 times [2025-03-03 09:53:29,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048603692] [2025-03-03 09:53:29,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:29,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 09:53:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 09:53:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:29,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:53:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048603692] [2025-03-03 09:53:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048603692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:30,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110089642] [2025-03-03 09:53:30,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:30,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:30,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:30,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:30,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:30,075 INFO L87 Difference]: Start difference. First operand 11517 states and 14919 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:53:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:30,777 INFO L93 Difference]: Finished difference Result 28728 states and 38311 transitions. [2025-03-03 09:53:30,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:30,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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:53:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:30,807 INFO L225 Difference]: With dead ends: 28728 [2025-03-03 09:53:30,808 INFO L226 Difference]: Without dead ends: 17213 [2025-03-03 09:53:30,822 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:53:30,823 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 235 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:30,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 404 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:53:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17213 states. [2025-03-03 09:53:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17213 to 15581. [2025-03-03 09:53:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15581 states, 15580 states have (on average 1.2542362002567393) internal successors, (19541), 15580 states have internal predecessors, (19541), 0 states have call successors, (0), 0 states 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:53:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15581 states to 15581 states and 19541 transitions. [2025-03-03 09:53:31,102 INFO L78 Accepts]: Start accepts. Automaton has 15581 states and 19541 transitions. Word has length 195 [2025-03-03 09:53:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:31,102 INFO L471 AbstractCegarLoop]: Abstraction has 15581 states and 19541 transitions. [2025-03-03 09:53:31,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:53:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 15581 states and 19541 transitions. [2025-03-03 09:53:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 09:53:31,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:31,116 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:31,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:53:31,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:31,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:31,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1395181902, now seen corresponding path program 1 times [2025-03-03 09:53:31,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:31,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415504254] [2025-03-03 09:53:31,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:31,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:31,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 09:53:31,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 09:53:31,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:31,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:53:31,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:31,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415504254] [2025-03-03 09:53:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415504254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:31,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829785895] [2025-03-03 09:53:31,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:31,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:53:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:31,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:53:31,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:53:31,478 INFO L87 Difference]: Start difference. First operand 15581 states and 19541 transitions. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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:53:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:32,409 INFO L93 Difference]: Finished difference Result 42080 states and 52494 transitions. [2025-03-03 09:53:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:53:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 268 [2025-03-03 09:53:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:32,454 INFO L225 Difference]: With dead ends: 42080 [2025-03-03 09:53:32,455 INFO L226 Difference]: Without dead ends: 26501 [2025-03-03 09:53:32,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:53:32,474 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 544 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:32,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 58 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:53:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26501 states. [2025-03-03 09:53:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26501 to 26497. [2025-03-03 09:53:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26497 states, 26496 states have (on average 1.1798762077294687) internal successors, (31262), 26496 states have internal predecessors, (31262), 0 states have call successors, (0), 0 states 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:53:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26497 states to 26497 states and 31262 transitions. [2025-03-03 09:53:32,849 INFO L78 Accepts]: Start accepts. Automaton has 26497 states and 31262 transitions. Word has length 268 [2025-03-03 09:53:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:32,849 INFO L471 AbstractCegarLoop]: Abstraction has 26497 states and 31262 transitions. [2025-03-03 09:53:32,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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:53:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26497 states and 31262 transitions. [2025-03-03 09:53:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 09:53:32,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:32,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:53:32,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:53:32,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:32,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1007927422, now seen corresponding path program 1 times [2025-03-03 09:53:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:32,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718824455] [2025-03-03 09:53:32,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:32,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 09:53:32,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 09:53:32,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:32,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718824455] [2025-03-03 09:53:33,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718824455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394687505] [2025-03-03 09:53:33,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:33,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:33,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:33,212 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:53:33,216 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:53:33,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 09:53:33,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 09:53:33,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:33,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:53:33,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:33,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:33,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394687505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:33,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:33,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669884782] [2025-03-03 09:53:33,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:33,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:33,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:33,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:33,561 INFO L87 Difference]: Start difference. First operand 26497 states and 31262 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:53:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:34,364 INFO L93 Difference]: Finished difference Result 53020 states and 62576 transitions. [2025-03-03 09:53:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2025-03-03 09:53:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:34,411 INFO L225 Difference]: With dead ends: 53020 [2025-03-03 09:53:34,411 INFO L226 Difference]: Without dead ends: 26525 [2025-03-03 09:53:34,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 275 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:53:34,433 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 51 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:34,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 368 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:53:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26525 states. [2025-03-03 09:53:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26525 to 26497. [2025-03-03 09:53:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26497 states, 26496 states have (on average 1.1712711352657006) internal successors, (31034), 26496 states have internal predecessors, (31034), 0 states have call successors, (0), 0 states 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:53:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26497 states to 26497 states and 31034 transitions. [2025-03-03 09:53:34,791 INFO L78 Accepts]: Start accepts. Automaton has 26497 states and 31034 transitions. Word has length 276 [2025-03-03 09:53:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:34,792 INFO L471 AbstractCegarLoop]: Abstraction has 26497 states and 31034 transitions. [2025-03-03 09:53:34,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:53:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 26497 states and 31034 transitions. [2025-03-03 09:53:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 09:53:34,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:34,814 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:34,821 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:53:35,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:35,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:35,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:35,016 INFO L85 PathProgramCache]: Analyzing trace with hash 190653063, now seen corresponding path program 1 times [2025-03-03 09:53:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:35,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966807067] [2025-03-03 09:53:35,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:35,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:35,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 09:53:35,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 09:53:35,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:35,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966807067] [2025-03-03 09:53:35,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966807067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:35,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:35,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034841670] [2025-03-03 09:53:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:35,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:53:35,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:35,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:53:35,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:53:35,350 INFO L87 Difference]: Start difference. First operand 26497 states and 31034 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:53:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:36,418 INFO L93 Difference]: Finished difference Result 60340 states and 70859 transitions. [2025-03-03 09:53:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:53:36,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2025-03-03 09:53:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:36,484 INFO L225 Difference]: With dead ends: 60340 [2025-03-03 09:53:36,484 INFO L226 Difference]: Without dead ends: 33845 [2025-03-03 09:53:36,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:53:36,508 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 472 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:36,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 79 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:53:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33845 states. [2025-03-03 09:53:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33845 to 33805. [2025-03-03 09:53:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33805 states, 33804 states have (on average 1.1546858359957402) internal successors, (39033), 33804 states have internal predecessors, (39033), 0 states have call successors, (0), 0 states 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:53:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33805 states to 33805 states and 39033 transitions. [2025-03-03 09:53:36,970 INFO L78 Accepts]: Start accepts. Automaton has 33805 states and 39033 transitions. Word has length 276 [2025-03-03 09:53:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:36,970 INFO L471 AbstractCegarLoop]: Abstraction has 33805 states and 39033 transitions. [2025-03-03 09:53:36,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:53:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 33805 states and 39033 transitions. [2025-03-03 09:53:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-03 09:53:36,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:36,987 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:36,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:53:36,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:36,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1601146424, now seen corresponding path program 1 times [2025-03-03 09:53:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951933002] [2025-03-03 09:53:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:37,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-03 09:53:37,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-03 09:53:37,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:37,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-03 09:53:37,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:37,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951933002] [2025-03-03 09:53:37,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951933002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:37,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:37,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198675534] [2025-03-03 09:53:37,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:37,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:37,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:37,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:37,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:37,170 INFO L87 Difference]: Start difference. First operand 33805 states and 39033 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:53:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:37,945 INFO L93 Difference]: Finished difference Result 83711 states and 96805 transitions. [2025-03-03 09:53:37,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:37,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 281 [2025-03-03 09:53:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:38,007 INFO L225 Difference]: With dead ends: 83711 [2025-03-03 09:53:38,008 INFO L226 Difference]: Without dead ends: 49908 [2025-03-03 09:53:38,035 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:53:38,036 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 205 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:38,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 146 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:53:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49908 states. [2025-03-03 09:53:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49908 to 49902. [2025-03-03 09:53:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49902 states, 49901 states have (on average 1.1552273501533035) internal successors, (57647), 49901 states have internal predecessors, (57647), 0 states have call successors, (0), 0 states 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:53:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49902 states to 49902 states and 57647 transitions. [2025-03-03 09:53:38,651 INFO L78 Accepts]: Start accepts. Automaton has 49902 states and 57647 transitions. Word has length 281 [2025-03-03 09:53:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:38,651 INFO L471 AbstractCegarLoop]: Abstraction has 49902 states and 57647 transitions. [2025-03-03 09:53:38,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:53:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 49902 states and 57647 transitions. [2025-03-03 09:53:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-03 09:53:38,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:38,671 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:38,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:53:38,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:38,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1152152483, now seen corresponding path program 1 times [2025-03-03 09:53:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:38,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436450090] [2025-03-03 09:53:38,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:38,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:38,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-03 09:53:38,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-03 09:53:38,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-03 09:53:39,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436450090] [2025-03-03 09:53:39,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436450090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554790984] [2025-03-03 09:53:39,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:39,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:39,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:39,044 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:53:39,045 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:53:39,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-03 09:53:39,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-03 09:53:39,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:39,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:39,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:53:39,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 09:53:39,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554790984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993834301] [2025-03-03 09:53:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:39,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:39,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:39,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:39,331 INFO L87 Difference]: Start difference. First operand 49902 states and 57647 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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:53:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:39,973 INFO L93 Difference]: Finished difference Result 99006 states and 114466 transitions. [2025-03-03 09:53:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 288 [2025-03-03 09:53:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:40,031 INFO L225 Difference]: With dead ends: 99006 [2025-03-03 09:53:40,031 INFO L226 Difference]: Without dead ends: 49106 [2025-03-03 09:53:40,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:40,065 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:40,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 291 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:53:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49106 states. [2025-03-03 09:53:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49106 to 47466. [2025-03-03 09:53:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47466 states, 47465 states have (on average 1.1440219108817022) internal successors, (54301), 47465 states have internal predecessors, (54301), 0 states have call successors, (0), 0 states 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:53:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47466 states to 47466 states and 54301 transitions. [2025-03-03 09:53:40,767 INFO L78 Accepts]: Start accepts. Automaton has 47466 states and 54301 transitions. Word has length 288 [2025-03-03 09:53:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:40,768 INFO L471 AbstractCegarLoop]: Abstraction has 47466 states and 54301 transitions. [2025-03-03 09:53:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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:53:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47466 states and 54301 transitions. [2025-03-03 09:53:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-03 09:53:40,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:40,795 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:40,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:53:40,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:53:40,996 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:40,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1493489087, now seen corresponding path program 1 times [2025-03-03 09:53:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606007059] [2025-03-03 09:53:40,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:41,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-03 09:53:41,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-03 09:53:41,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:41,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-03 09:53:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606007059] [2025-03-03 09:53:41,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606007059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795977301] [2025-03-03 09:53:41,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:41,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:41,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:41,451 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:53:41,453 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:53:41,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-03 09:53:41,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-03 09:53:41,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:41,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:41,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:53:41,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-03 09:53:41,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:41,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795977301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:41,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:41,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 09:53:41,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818827887] [2025-03-03 09:53:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:41,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:41,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:41,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:41,790 INFO L87 Difference]: Start difference. First operand 47466 states and 54301 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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:53:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:42,153 INFO L93 Difference]: Finished difference Result 94922 states and 108592 transitions. [2025-03-03 09:53:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:42,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 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 330 [2025-03-03 09:53:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:42,199 INFO L225 Difference]: With dead ends: 94922 [2025-03-03 09:53:42,200 INFO L226 Difference]: Without dead ends: 47458 [2025-03-03 09:53:42,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:42,231 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 275 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:42,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 29 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:53:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47458 states. [2025-03-03 09:53:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47458 to 47454. [2025-03-03 09:53:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47454 states, 47453 states have (on average 1.143889743535709) internal successors, (54281), 47453 states have internal predecessors, (54281), 0 states have call successors, (0), 0 states 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:53:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47454 states to 47454 states and 54281 transitions. [2025-03-03 09:53:42,657 INFO L78 Accepts]: Start accepts. Automaton has 47454 states and 54281 transitions. Word has length 330 [2025-03-03 09:53:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:42,657 INFO L471 AbstractCegarLoop]: Abstraction has 47454 states and 54281 transitions. [2025-03-03 09:53:42,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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:53:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47454 states and 54281 transitions. [2025-03-03 09:53:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 09:53:42,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:42,682 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:42,688 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:53:42,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:42,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:42,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash 749307246, now seen corresponding path program 1 times [2025-03-03 09:53:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:42,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260100696] [2025-03-03 09:53:42,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:42,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:42,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 09:53:42,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 09:53:42,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:42,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-03 09:53:43,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:43,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260100696] [2025-03-03 09:53:43,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260100696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:43,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98919206] [2025-03-03 09:53:43,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:43,267 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:53:43,268 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:53:43,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 09:53:43,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 09:53:43,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:43,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:43,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:53:43,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 09:53:43,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98919206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145369868] [2025-03-03 09:53:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:43,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:43,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:43,468 INFO L87 Difference]: Start difference. First operand 47454 states and 54281 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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:53:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:43,922 INFO L93 Difference]: Finished difference Result 137020 states and 156812 transitions. [2025-03-03 09:53:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 339 [2025-03-03 09:53:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:44,154 INFO L225 Difference]: With dead ends: 137020 [2025-03-03 09:53:44,154 INFO L226 Difference]: Without dead ends: 89568 [2025-03-03 09:53:44,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:44,170 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 288 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:44,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 841 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:53:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89568 states. [2025-03-03 09:53:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89568 to 89566. [2025-03-03 09:53:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89566 states, 89565 states have (on average 1.1330542064422486) internal successors, (101482), 89565 states have internal predecessors, (101482), 0 states have call successors, (0), 0 states 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:53:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89566 states to 89566 states and 101482 transitions. [2025-03-03 09:53:45,249 INFO L78 Accepts]: Start accepts. Automaton has 89566 states and 101482 transitions. Word has length 339 [2025-03-03 09:53:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:45,249 INFO L471 AbstractCegarLoop]: Abstraction has 89566 states and 101482 transitions. [2025-03-03 09:53:45,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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:53:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 89566 states and 101482 transitions. [2025-03-03 09:53:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-03 09:53:45,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:45,297 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:45,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:53:45,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:45,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:45,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1627099226, now seen corresponding path program 1 times [2025-03-03 09:53:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517981838] [2025-03-03 09:53:45,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:45,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-03 09:53:45,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-03 09:53:45,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:45,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-03 09:53:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517981838] [2025-03-03 09:53:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517981838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221568867] [2025-03-03 09:53:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:45,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:45,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:45,920 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:53:45,921 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:53:46,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-03 09:53:46,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-03 09:53:46,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:46,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:46,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:53:46,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-03 09:53:46,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221568867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:46,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:46,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811677647] [2025-03-03 09:53:46,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:46,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:46,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:46,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:46,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:46,253 INFO L87 Difference]: Start difference. First operand 89566 states and 101482 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:53:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:47,438 INFO L93 Difference]: Finished difference Result 227265 states and 256898 transitions. [2025-03-03 09:53:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 341 [2025-03-03 09:53:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:47,765 INFO L225 Difference]: With dead ends: 227265 [2025-03-03 09:53:47,765 INFO L226 Difference]: Without dead ends: 137701 [2025-03-03 09:53:47,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:47,810 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 81 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:47,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 338 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:53:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137701 states. [2025-03-03 09:53:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137701 to 134031. [2025-03-03 09:53:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134031 states, 134030 states have (on average 1.1040065656942475) internal successors, (147970), 134030 states have internal predecessors, (147970), 0 states have call successors, (0), 0 states 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:53:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134031 states to 134031 states and 147970 transitions. [2025-03-03 09:53:49,232 INFO L78 Accepts]: Start accepts. Automaton has 134031 states and 147970 transitions. Word has length 341 [2025-03-03 09:53:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:49,232 INFO L471 AbstractCegarLoop]: Abstraction has 134031 states and 147970 transitions. [2025-03-03 09:53:49,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:53:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 134031 states and 147970 transitions. [2025-03-03 09:53:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-03 09:53:49,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:49,294 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:49,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:53:49,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:53:49,494 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:49,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash 48773638, now seen corresponding path program 1 times [2025-03-03 09:53:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875745461] [2025-03-03 09:53:49,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-03 09:53:49,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-03 09:53:49,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:49,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 136 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 09:53:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875745461] [2025-03-03 09:53:50,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875745461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103668390] [2025-03-03 09:53:50,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:50,239 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:53:50,240 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:53:50,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-03 09:53:50,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-03 09:53:50,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:50,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:50,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:53:50,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 09:53:50,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103668390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:50,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821442135] [2025-03-03 09:53:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:50,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:53:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:50,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:53:50,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:50,506 INFO L87 Difference]: Start difference. First operand 134031 states and 147970 transitions. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:53:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:52,238 INFO L93 Difference]: Finished difference Result 359116 states and 396584 transitions. [2025-03-03 09:53:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:53:52,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 379 [2025-03-03 09:53:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:52,563 INFO L225 Difference]: With dead ends: 359116 [2025-03-03 09:53:52,563 INFO L226 Difference]: Without dead ends: 225087 [2025-03-03 09:53:52,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:52,615 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 757 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:52,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 308 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:53:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225087 states. [2025-03-03 09:53:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225087 to 222633. [2025-03-03 09:53:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222633 states, 222632 states have (on average 1.0949324445722088) internal successors, (243767), 222632 states have internal predecessors, (243767), 0 states have call successors, (0), 0 states 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:53:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222633 states to 222633 states and 243767 transitions. [2025-03-03 09:53:55,541 INFO L78 Accepts]: Start accepts. Automaton has 222633 states and 243767 transitions. Word has length 379 [2025-03-03 09:53:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:55,542 INFO L471 AbstractCegarLoop]: Abstraction has 222633 states and 243767 transitions. [2025-03-03 09:53:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:53:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 222633 states and 243767 transitions. [2025-03-03 09:53:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-03 09:53:55,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:55,571 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:53:55,578 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:53:55,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:53:55,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:55,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash -951519350, now seen corresponding path program 1 times [2025-03-03 09:53:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:55,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651193929] [2025-03-03 09:53:55,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:55,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-03 09:53:55,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-03 09:53:55,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:55,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 09:53:56,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:56,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651193929] [2025-03-03 09:53:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651193929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:56,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:56,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962720800] [2025-03-03 09:53:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:56,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:56,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:56,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:56,083 INFO L87 Difference]: Start difference. First operand 222633 states and 243767 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:53:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:57,778 INFO L93 Difference]: Finished difference Result 444673 states and 486869 transitions. [2025-03-03 09:53:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:57,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2025-03-03 09:53:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:58,088 INFO L225 Difference]: With dead ends: 444673 [2025-03-03 09:53:58,088 INFO L226 Difference]: Without dead ends: 222042 [2025-03-03 09:53:58,202 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:53:58,202 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:58,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 116 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:53:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222042 states. [2025-03-03 09:54:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222042 to 219583. [2025-03-03 09:54:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219583 states, 219582 states have (on average 1.0804801850789227) internal successors, (237254), 219582 states have internal predecessors, (237254), 0 states have call successors, (0), 0 states 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:54:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219583 states to 219583 states and 237254 transitions. [2025-03-03 09:54:01,040 INFO L78 Accepts]: Start accepts. Automaton has 219583 states and 237254 transitions. Word has length 386 [2025-03-03 09:54:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:54:01,040 INFO L471 AbstractCegarLoop]: Abstraction has 219583 states and 237254 transitions. [2025-03-03 09:54:01,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:54:01,041 INFO L276 IsEmpty]: Start isEmpty. Operand 219583 states and 237254 transitions. [2025-03-03 09:54:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-03 09:54:01,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:54:01,079 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:01,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:54:01,080 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:54:01,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:54:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash 94610192, now seen corresponding path program 1 times [2025-03-03 09:54:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:54:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399654645] [2025-03-03 09:54:01,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:54:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:54:01,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-03 09:54:01,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-03 09:54:01,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:54:01,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:54:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 09:54:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:54:01,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399654645] [2025-03-03 09:54:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399654645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:54:01,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:54:01,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:54:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835401236] [2025-03-03 09:54:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:54:01,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:54:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:54:01,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:54:01,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:54:01,666 INFO L87 Difference]: Start difference. First operand 219583 states and 237254 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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:54:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:54:03,095 INFO L93 Difference]: Finished difference Result 447151 states and 483647 transitions. [2025-03-03 09:54:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:54:03,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 401 [2025-03-03 09:54:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:54:03,376 INFO L225 Difference]: With dead ends: 447151 [2025-03-03 09:54:03,376 INFO L226 Difference]: Without dead ends: 211127 [2025-03-03 09:54:03,496 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:54:03,496 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 89 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:54:03,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 330 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:54:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211127 states. [2025-03-03 09:54:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211127 to 185865. [2025-03-03 09:54:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185865 states, 185864 states have (on average 1.0718267120044764) internal successors, (199214), 185864 states have internal predecessors, (199214), 0 states have call successors, (0), 0 states 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:54:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185865 states to 185865 states and 199214 transitions. [2025-03-03 09:54:06,245 INFO L78 Accepts]: Start accepts. Automaton has 185865 states and 199214 transitions. Word has length 401 [2025-03-03 09:54:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:54:06,245 INFO L471 AbstractCegarLoop]: Abstraction has 185865 states and 199214 transitions. [2025-03-03 09:54:06,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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:54:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 185865 states and 199214 transitions. [2025-03-03 09:54:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-03 09:54:06,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:54:06,266 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:06,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 09:54:06,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:54:06,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:54:06,267 INFO L85 PathProgramCache]: Analyzing trace with hash -28670828, now seen corresponding path program 1 times [2025-03-03 09:54:06,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:54:06,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722216264] [2025-03-03 09:54:06,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:54:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:54:06,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-03 09:54:06,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-03 09:54:06,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:54:06,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:54:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 265 proven. 9 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-03 09:54:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:54:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722216264] [2025-03-03 09:54:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722216264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:54:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726437894] [2025-03-03 09:54:06,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:54:06,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:54:06,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:54:06,925 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:54:06,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:54:07,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-03 09:54:07,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-03 09:54:07,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:54:07,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:54:07,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:54:07,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:54:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-03 09:54:07,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:54:07,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726437894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:54:07,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:54:07,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:54:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778542763] [2025-03-03 09:54:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:54:07,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:54:07,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:54:07,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:54:07,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:54:07,130 INFO L87 Difference]: Start difference. First operand 185865 states and 199214 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:54:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:54:08,403 INFO L93 Difference]: Finished difference Result 371777 states and 398514 transitions. [2025-03-03 09:54:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:54:08,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2025-03-03 09:54:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:54:08,607 INFO L225 Difference]: With dead ends: 371777 [2025-03-03 09:54:08,608 INFO L226 Difference]: Without dead ends: 185914 [2025-03-03 09:54:08,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 408 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:54:08,698 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 210 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:54:08,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 365 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:54:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185914 states. [2025-03-03 09:54:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185914 to 182609.