./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.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 5af223e668aa8b86ae636f9439d9ac4f153fc620faa9da4461ac4ba5e2c60ee8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:02:18,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:02:18,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:02:18,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:02:18,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:02:18,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:02:18,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:02:18,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:02:19,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:02:19,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:02:19,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:02:19,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:02:19,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:02:19,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:02:19,001 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:02:19,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:02:19,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:02:19,001 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:02:19,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:02:19,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:02:19,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:02:19,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:02:19,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:02:19,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:02:19,002 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:02:19,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:02:19,002 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:02:19,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:02:19,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:02:19,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:02:19,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:02:19,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:02:19,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:02:19,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:02:19,004 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 -> 5af223e668aa8b86ae636f9439d9ac4f153fc620faa9da4461ac4ba5e2c60ee8 [2025-03-03 16:02:19,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:02:19,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:02:19,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:02:19,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:02:19,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:02:19,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:02:20,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54afebd5d/a345726cc33f46ccbed90ad3b9232c71/FLAGa7bf7e777 [2025-03-03 16:02:20,748 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:02:20,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:02:20,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54afebd5d/a345726cc33f46ccbed90ad3b9232c71/FLAGa7bf7e777 [2025-03-03 16:02:20,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54afebd5d/a345726cc33f46ccbed90ad3b9232c71 [2025-03-03 16:02:20,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:02:20,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:02:20,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:02:20,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:02:20,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:02:20,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:02:20" (1/1) ... [2025-03-03 16:02:20,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a79db7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:20, skipping insertion in model container [2025-03-03 16:02:20,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:02:20" (1/1) ... [2025-03-03 16:02:20,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:02:21,103 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.c[6450,6463] [2025-03-03 16:02:21,129 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.c[8325,8338] [2025-03-03 16:02:21,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:02:21,530 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:02:21,552 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.c[6450,6463] [2025-03-03 16:02:21,560 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.c[8325,8338] [2025-03-03 16:02:21,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:02:21,841 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:02:21,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21 WrapperNode [2025-03-03 16:02:21,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:02:21,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:02:21,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:02:21,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:02:21,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:21,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,065 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4977 [2025-03-03 16:02:22,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:02:22,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:02:22,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:02:22,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:02:22,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,246 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 16:02:22,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:02:22,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:02:22,427 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:02:22,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:02:22,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (1/1) ... [2025-03-03 16:02:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:02:22,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:22,451 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 16:02:22,458 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 16:02:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:02:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:02:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:02:22,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:02:22,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:02:22,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:02:25,629 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc calculate_output_#t~ret29#1; [2025-03-03 16:02:25,629 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc calculate_output2_#t~ret30#1; [2025-03-03 16:02:25,629 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc calculate_output3_#t~ret31#1; [2025-03-03 16:02:25,708 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-03-03 16:02:25,708 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:02:25,740 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:02:25,740 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:02:25,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:02:25 BoogieIcfgContainer [2025-03-03 16:02:25,741 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:02:25,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:02:25,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:02:25,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:02:25,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:02:20" (1/3) ... [2025-03-03 16:02:25,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7d9eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:02:25, skipping insertion in model container [2025-03-03 16:02:25,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:02:21" (2/3) ... [2025-03-03 16:02:25,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7d9eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:02:25, skipping insertion in model container [2025-03-03 16:02:25,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:02:25" (3/3) ... [2025-03-03 16:02:25,747 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:02:25,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:02:25,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label00.c that has 1 procedures, 873 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:02:25,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:02:25,826 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;@6ca1a76b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:02:25,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:02:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 16:02:25,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:25,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:25,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:25,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:25,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1868094412, now seen corresponding path program 1 times [2025-03-03 16:02:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:25,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919932343] [2025-03-03 16:02:25,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:25,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 16:02:25,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 16:02:25,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:25,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:26,041 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 16:02:26,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:26,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919932343] [2025-03-03 16:02:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919932343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:26,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:26,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:02:26,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98557124] [2025-03-03 16:02:26,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:26,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:02:26,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:26,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:02:26,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:02:26,067 INFO L87 Difference]: Start difference. First operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 0 states have call successors, (0), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:28,807 INFO L93 Difference]: Finished difference Result 2478 states and 4774 transitions. [2025-03-03 16:02:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:02:28,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-03-03 16:02:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:28,830 INFO L225 Difference]: With dead ends: 2478 [2025-03-03 16:02:28,831 INFO L226 Difference]: Without dead ends: 1559 [2025-03-03 16:02:28,838 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 16:02:28,840 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 907 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:28,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 571 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 16:02:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-03-03 16:02:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-03-03 16:02:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1557 states have (on average 1.640333975594091) internal successors, (2554), 1558 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2554 transitions. [2025-03-03 16:02:28,951 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2554 transitions. Word has length 16 [2025-03-03 16:02:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:28,951 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2554 transitions. [2025-03-03 16:02:28,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2554 transitions. [2025-03-03 16:02:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:02:28,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:28,953 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] [2025-03-03 16:02:28,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:02:28,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:28,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash 122716657, now seen corresponding path program 1 times [2025-03-03 16:02:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:28,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535496547] [2025-03-03 16:02:28,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:28,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:28,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:02:28,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:02:28,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:28,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:29,165 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 16:02:29,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535496547] [2025-03-03 16:02:29,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535496547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:29,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:29,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:02:29,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087281932] [2025-03-03 16:02:29,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:29,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:02:29,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:29,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:02:29,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:02:29,168 INFO L87 Difference]: Start difference. First operand 1559 states and 2554 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:29,211 INFO L93 Difference]: Finished difference Result 1595 states and 2608 transitions. [2025-03-03 16:02:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:02:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-03 16:02:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:29,216 INFO L225 Difference]: With dead ends: 1595 [2025-03-03 16:02:29,217 INFO L226 Difference]: Without dead ends: 1559 [2025-03-03 16:02:29,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:02:29,218 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:29,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-03-03 16:02:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-03-03 16:02:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1557 states have (on average 1.630057803468208) internal successors, (2538), 1558 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2538 transitions. [2025-03-03 16:02:29,255 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2538 transitions. Word has length 20 [2025-03-03 16:02:29,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:29,255 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2538 transitions. [2025-03-03 16:02:29,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2538 transitions. [2025-03-03 16:02:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 16:02:29,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:29,257 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] [2025-03-03 16:02:29,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:02:29,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:29,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:29,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1237708420, now seen corresponding path program 1 times [2025-03-03 16:02:29,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:29,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088443761] [2025-03-03 16:02:29,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:29,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 16:02:29,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 16:02:29,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:29,398 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 16:02:29,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:29,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088443761] [2025-03-03 16:02:29,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088443761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:29,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:29,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:02:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135403136] [2025-03-03 16:02:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:29,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:02:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:29,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:02:29,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:02:29,400 INFO L87 Difference]: Start difference. First operand 1559 states and 2538 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:29,483 INFO L93 Difference]: Finished difference Result 1751 states and 2838 transitions. [2025-03-03 16:02:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:02:29,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-03 16:02:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:29,489 INFO L225 Difference]: With dead ends: 1751 [2025-03-03 16:02:29,490 INFO L226 Difference]: Without dead ends: 1719 [2025-03-03 16:02:29,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:02:29,491 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 4644 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4644 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:29,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4644 Valid, 1789 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2025-03-03 16:02:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1589. [2025-03-03 16:02:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1587 states have (on average 1.6288594833018273) internal successors, (2585), 1588 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2585 transitions. [2025-03-03 16:02:29,519 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2585 transitions. Word has length 35 [2025-03-03 16:02:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:29,519 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2585 transitions. [2025-03-03 16:02:29,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2585 transitions. [2025-03-03 16:02:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:02:29,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:29,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:29,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:02:29,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:29,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash 852203871, now seen corresponding path program 1 times [2025-03-03 16:02:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335080242] [2025-03-03 16:02:29,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:29,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:29,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:02:29,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:02:29,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:29,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:29,582 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 16:02:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335080242] [2025-03-03 16:02:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335080242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:29,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:29,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236729067] [2025-03-03 16:02:29,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:29,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:02:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:29,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:02:29,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:02:29,586 INFO L87 Difference]: Start difference. First operand 1589 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:29,619 INFO L93 Difference]: Finished difference Result 1702 states and 2760 transitions. [2025-03-03 16:02:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:02:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 16:02:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:29,625 INFO L225 Difference]: With dead ends: 1702 [2025-03-03 16:02:29,625 INFO L226 Difference]: Without dead ends: 1640 [2025-03-03 16:02:29,626 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 16:02:29,628 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:29,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-03-03 16:02:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1636. [2025-03-03 16:02:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 1.6248470012239902) internal successors, (2655), 1635 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2655 transitions. [2025-03-03 16:02:29,661 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2655 transitions. Word has length 37 [2025-03-03 16:02:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:29,662 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2655 transitions. [2025-03-03 16:02:29,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2655 transitions. [2025-03-03 16:02:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:02:29,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:29,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:29,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:02:29,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:29,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash 884527106, now seen corresponding path program 1 times [2025-03-03 16:02:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:29,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801001061] [2025-03-03 16:02:29,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:02:29,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:02:29,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:29,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:29,845 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 16:02:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801001061] [2025-03-03 16:02:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801001061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:29,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:29,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:02:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401605006] [2025-03-03 16:02:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:29,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:02:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:29,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:02:29,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:02:29,848 INFO L87 Difference]: Start difference. First operand 1636 states and 2655 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:29,915 INFO L93 Difference]: Finished difference Result 1747 states and 2823 transitions. [2025-03-03 16:02:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:02:29,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 16:02:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:29,921 INFO L225 Difference]: With dead ends: 1747 [2025-03-03 16:02:29,921 INFO L226 Difference]: Without dead ends: 1638 [2025-03-03 16:02:29,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:02:29,923 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 4426 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4426 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:29,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4426 Valid, 1599 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-03-03 16:02:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1636. [2025-03-03 16:02:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 1.6236230110159118) internal successors, (2653), 1635 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2653 transitions. [2025-03-03 16:02:29,952 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2653 transitions. Word has length 37 [2025-03-03 16:02:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:29,953 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2653 transitions. [2025-03-03 16:02:29,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2653 transitions. [2025-03-03 16:02:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 16:02:29,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:29,955 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] [2025-03-03 16:02:29,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:02:29,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:29,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1681074244, now seen corresponding path program 1 times [2025-03-03 16:02:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:29,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409691764] [2025-03-03 16:02:29,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:29,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:29,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 16:02:29,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 16:02:29,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:29,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:30,165 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 16:02:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409691764] [2025-03-03 16:02:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409691764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:30,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:30,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:02:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581287396] [2025-03-03 16:02:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:30,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:02:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:30,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:02:30,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:02:30,167 INFO L87 Difference]: Start difference. First operand 1636 states and 2653 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:30,231 INFO L93 Difference]: Finished difference Result 1644 states and 2662 transitions. [2025-03-03 16:02:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:02:30,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-03 16:02:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:30,237 INFO L225 Difference]: With dead ends: 1644 [2025-03-03 16:02:30,238 INFO L226 Difference]: Without dead ends: 1642 [2025-03-03 16:02:30,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:02:30,239 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:30,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2025-03-03 16:02:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2025-03-03 16:02:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1640 states have (on average 1.6207317073170733) internal successors, (2658), 1641 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2658 transitions. [2025-03-03 16:02:30,273 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2658 transitions. Word has length 38 [2025-03-03 16:02:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:30,273 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 2658 transitions. [2025-03-03 16:02:30,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2658 transitions. [2025-03-03 16:02:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:02:30,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:30,274 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] [2025-03-03 16:02:30,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:02:30,274 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:30,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1052560352, now seen corresponding path program 1 times [2025-03-03 16:02:30,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:30,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883251883] [2025-03-03 16:02:30,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:30,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:02:30,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:02:30,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:30,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:30,338 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 16:02:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883251883] [2025-03-03 16:02:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883251883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:30,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323902766] [2025-03-03 16:02:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:30,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:02:30,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:30,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:02:30,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:02:30,340 INFO L87 Difference]: Start difference. First operand 1642 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:30,364 INFO L93 Difference]: Finished difference Result 1856 states and 2970 transitions. [2025-03-03 16:02:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:02:30,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 16:02:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:30,369 INFO L225 Difference]: With dead ends: 1856 [2025-03-03 16:02:30,369 INFO L226 Difference]: Without dead ends: 1741 [2025-03-03 16:02:30,370 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 16:02:30,371 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:30,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2025-03-03 16:02:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1739. [2025-03-03 16:02:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1737 states have (on average 1.6090961427748993) internal successors, (2795), 1738 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2795 transitions. [2025-03-03 16:02:30,404 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2795 transitions. Word has length 39 [2025-03-03 16:02:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:30,405 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2795 transitions. [2025-03-03 16:02:30,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2795 transitions. [2025-03-03 16:02:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:02:30,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:30,406 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] [2025-03-03 16:02:30,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:02:30,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:30,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1539278624, now seen corresponding path program 1 times [2025-03-03 16:02:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:30,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743949104] [2025-03-03 16:02:30,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:30,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:02:30,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:02:30,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:30,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:30,455 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 16:02:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:30,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743949104] [2025-03-03 16:02:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743949104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:30,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:30,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:30,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412755073] [2025-03-03 16:02:30,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:30,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:02:30,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:30,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:02:30,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:02:30,457 INFO L87 Difference]: Start difference. First operand 1739 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:30,481 INFO L93 Difference]: Finished difference Result 2131 states and 3353 transitions. [2025-03-03 16:02:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:02:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 16:02:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:30,486 INFO L225 Difference]: With dead ends: 2131 [2025-03-03 16:02:30,487 INFO L226 Difference]: Without dead ends: 1919 [2025-03-03 16:02:30,487 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 16:02:30,488 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:30,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1595 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-03-03 16:02:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1917. [2025-03-03 16:02:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1915 states have (on average 1.5859007832898173) internal successors, (3037), 1916 states have internal predecessors, (3037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 3037 transitions. [2025-03-03 16:02:30,521 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 3037 transitions. Word has length 39 [2025-03-03 16:02:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:30,524 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 3037 transitions. [2025-03-03 16:02:30,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 3037 transitions. [2025-03-03 16:02:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 16:02:30,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:30,524 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] [2025-03-03 16:02:30,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:02:30,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:30,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash -285813920, now seen corresponding path program 1 times [2025-03-03 16:02:30,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:30,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401962191] [2025-03-03 16:02:30,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:30,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 16:02:30,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 16:02:30,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:30,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:30,567 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 16:02:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:30,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401962191] [2025-03-03 16:02:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401962191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:30,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:30,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:30,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403785945] [2025-03-03 16:02:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:30,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:02:30,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:30,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:02:30,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:02:30,569 INFO L87 Difference]: Start difference. First operand 1917 states and 3037 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:30,607 INFO L93 Difference]: Finished difference Result 2340 states and 3643 transitions. [2025-03-03 16:02:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:02:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-03 16:02:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:30,614 INFO L225 Difference]: With dead ends: 2340 [2025-03-03 16:02:30,614 INFO L226 Difference]: Without dead ends: 2105 [2025-03-03 16:02:30,615 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 16:02:30,615 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:30,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2025-03-03 16:02:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2103. [2025-03-03 16:02:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2101 states have (on average 1.5663969538315088) internal successors, (3291), 2102 states have internal predecessors, (3291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 3291 transitions. [2025-03-03 16:02:30,657 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 3291 transitions. Word has length 41 [2025-03-03 16:02:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:30,657 INFO L471 AbstractCegarLoop]: Abstraction has 2103 states and 3291 transitions. [2025-03-03 16:02:30,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 3291 transitions. [2025-03-03 16:02:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:02:30,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:30,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:30,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:02:30,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:30,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash -579892588, now seen corresponding path program 1 times [2025-03-03 16:02:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:30,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704017210] [2025-03-03 16:02:30,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:30,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:02:30,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:02:30,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:30,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:02:30,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:30,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704017210] [2025-03-03 16:02:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704017210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:30,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:02:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9246492] [2025-03-03 16:02:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:30,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:02:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:30,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:02:30,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:02:30,751 INFO L87 Difference]: Start difference. First operand 2103 states and 3291 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:30,835 INFO L93 Difference]: Finished difference Result 3959 states and 5871 transitions. [2025-03-03 16:02:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:02:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 54 [2025-03-03 16:02:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:30,846 INFO L225 Difference]: With dead ends: 3959 [2025-03-03 16:02:30,846 INFO L226 Difference]: Without dead ends: 3385 [2025-03-03 16:02:30,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:02:30,848 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3050 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3050 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:30,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3050 Valid, 3171 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2025-03-03 16:02:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2675. [2025-03-03 16:02:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2673 states have (on average 1.5260007482229705) internal successors, (4079), 2674 states have internal predecessors, (4079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4079 transitions. [2025-03-03 16:02:30,904 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4079 transitions. Word has length 54 [2025-03-03 16:02:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:30,904 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 4079 transitions. [2025-03-03 16:02:30,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4079 transitions. [2025-03-03 16:02:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:02:30,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:30,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:30,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:02:30,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:30,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1066610860, now seen corresponding path program 1 times [2025-03-03 16:02:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:30,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002452838] [2025-03-03 16:02:30,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:30,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:02:30,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:02:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:02:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002452838] [2025-03-03 16:02:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002452838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:30,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:02:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365797771] [2025-03-03 16:02:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:30,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:02:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:30,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:02:30,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:02:30,984 INFO L87 Difference]: Start difference. First operand 2675 states and 4079 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:31,129 INFO L93 Difference]: Finished difference Result 4531 states and 6659 transitions. [2025-03-03 16:02:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:02:31,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 54 [2025-03-03 16:02:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:31,142 INFO L225 Difference]: With dead ends: 4531 [2025-03-03 16:02:31,143 INFO L226 Difference]: Without dead ends: 3957 [2025-03-03 16:02:31,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:02:31,145 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3059 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:31,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 3148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3957 states. [2025-03-03 16:02:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3957 to 3535. [2025-03-03 16:02:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 3533 states have (on average 1.486272289838664) internal successors, (5251), 3534 states have internal predecessors, (5251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 5251 transitions. [2025-03-03 16:02:31,275 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 5251 transitions. Word has length 54 [2025-03-03 16:02:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:31,279 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 5251 transitions. [2025-03-03 16:02:31,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 5251 transitions. [2025-03-03 16:02:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:02:31,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:31,280 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] [2025-03-03 16:02:31,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:02:31,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2073319406, now seen corresponding path program 1 times [2025-03-03 16:02:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31038205] [2025-03-03 16:02:31,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:31,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:02:31,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:02:31,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:31,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:31,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:31,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31038205] [2025-03-03 16:02:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31038205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:31,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560478225] [2025-03-03 16:02:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:02:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:31,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:02:31,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:02:31,380 INFO L87 Difference]: Start difference. First operand 3535 states and 5251 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:31,421 INFO L93 Difference]: Finished difference Result 5011 states and 7314 transitions. [2025-03-03 16:02:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:02:31,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 16:02:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:31,431 INFO L225 Difference]: With dead ends: 5011 [2025-03-03 16:02:31,431 INFO L226 Difference]: Without dead ends: 3005 [2025-03-03 16:02:31,433 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 16:02:31,435 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:31,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2025-03-03 16:02:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3003. [2025-03-03 16:02:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3003 states, 3001 states have (on average 1.5071642785738086) internal successors, (4523), 3002 states have internal predecessors, (4523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 4523 transitions. [2025-03-03 16:02:31,493 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 4523 transitions. Word has length 56 [2025-03-03 16:02:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:31,493 INFO L471 AbstractCegarLoop]: Abstraction has 3003 states and 4523 transitions. [2025-03-03 16:02:31,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 4523 transitions. [2025-03-03 16:02:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:02:31,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:31,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:31,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:02:31,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:31,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1318626092, now seen corresponding path program 1 times [2025-03-03 16:02:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:31,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190689621] [2025-03-03 16:02:31,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:31,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:02:31,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:02:31,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:31,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:02:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:31,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190689621] [2025-03-03 16:02:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190689621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:02:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248198615] [2025-03-03 16:02:31,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:31,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:02:31,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:31,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:02:31,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:02:31,572 INFO L87 Difference]: Start difference. First operand 3003 states and 4523 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:31,649 INFO L93 Difference]: Finished difference Result 4259 states and 6279 transitions. [2025-03-03 16:02:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:02:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-03-03 16:02:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:31,665 INFO L225 Difference]: With dead ends: 4259 [2025-03-03 16:02:31,665 INFO L226 Difference]: Without dead ends: 3841 [2025-03-03 16:02:31,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:02:31,668 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 3051 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:31,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3174 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2025-03-03 16:02:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3419. [2025-03-03 16:02:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.492244659057653) internal successors, (5099), 3418 states have internal predecessors, (5099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5099 transitions. [2025-03-03 16:02:31,775 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5099 transitions. Word has length 56 [2025-03-03 16:02:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:31,775 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5099 transitions. [2025-03-03 16:02:31,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5099 transitions. [2025-03-03 16:02:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:02:31,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:31,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:31,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:02:31,777 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:31,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash -431595430, now seen corresponding path program 1 times [2025-03-03 16:02:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576944301] [2025-03-03 16:02:31,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:31,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:02:31,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:02:31,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:31,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:31,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:31,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576944301] [2025-03-03 16:02:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576944301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842735690] [2025-03-03 16:02:31,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:02:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:31,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:02:31,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:02:31,840 INFO L87 Difference]: Start difference. First operand 3419 states and 5099 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:31,871 INFO L93 Difference]: Finished difference Result 4359 states and 6397 transitions. [2025-03-03 16:02:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:02:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 16:02:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:31,875 INFO L225 Difference]: With dead ends: 4359 [2025-03-03 16:02:31,876 INFO L226 Difference]: Without dead ends: 2485 [2025-03-03 16:02:31,878 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 16:02:31,878 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:31,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-03 16:02:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2483. [2025-03-03 16:02:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5255945183393793) internal successors, (3785), 2482 states have internal predecessors, (3785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3785 transitions. [2025-03-03 16:02:31,916 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3785 transitions. Word has length 57 [2025-03-03 16:02:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:31,916 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3785 transitions. [2025-03-03 16:02:31,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3785 transitions. [2025-03-03 16:02:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:02:31,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:31,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:31,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:02:31,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:31,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1723141375, now seen corresponding path program 1 times [2025-03-03 16:02:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:31,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244439585] [2025-03-03 16:02:31,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:31,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:31,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:02:31,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:02:31,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:31,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:31,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:31,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244439585] [2025-03-03 16:02:31,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244439585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:31,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:31,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:31,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893550672] [2025-03-03 16:02:31,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:31,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:02:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:31,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:02:31,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:02:31,979 INFO L87 Difference]: Start difference. First operand 2483 states and 3785 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:32,003 INFO L93 Difference]: Finished difference Result 2955 states and 4426 transitions. [2025-03-03 16:02:32,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:02:32,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 16:02:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:32,007 INFO L225 Difference]: With dead ends: 2955 [2025-03-03 16:02:32,007 INFO L226 Difference]: Without dead ends: 2017 [2025-03-03 16:02:32,009 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 16:02:32,009 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:32,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:02:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2025-03-03 16:02:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 2015. [2025-03-03 16:02:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2013 states have (on average 1.5583705911574763) internal successors, (3137), 2014 states have internal predecessors, (3137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 3137 transitions. [2025-03-03 16:02:32,039 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 3137 transitions. Word has length 59 [2025-03-03 16:02:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:32,039 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 3137 transitions. [2025-03-03 16:02:32,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 3137 transitions. [2025-03-03 16:02:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:02:32,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:32,040 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:02:32,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:02:32,040 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:32,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1954883896, now seen corresponding path program 1 times [2025-03-03 16:02:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144977683] [2025-03-03 16:02:32,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:32,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:32,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:02:32,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:02:32,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:32,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:33,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144977683] [2025-03-03 16:02:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144977683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239695225] [2025-03-03 16:02:33,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:33,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:33,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:33,211 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 16:02:33,212 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 16:02:33,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:02:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:02:33,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:33,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:02:33,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:02:33,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:02:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239695225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:33,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-03-03 16:02:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145372221] [2025-03-03 16:02:33,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:33,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 16:02:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:33,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 16:02:33,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:02:33,604 INFO L87 Difference]: Start difference. First operand 2015 states and 3137 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:35,138 INFO L93 Difference]: Finished difference Result 4240 states and 6067 transitions. [2025-03-03 16:02:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 16:02:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 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 61 [2025-03-03 16:02:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:35,144 INFO L225 Difference]: With dead ends: 4240 [2025-03-03 16:02:35,144 INFO L226 Difference]: Without dead ends: 3770 [2025-03-03 16:02:35,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=513, Invalid=2243, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 16:02:35,148 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 13747 mSDsluCounter, 7776 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13747 SdHoareTripleChecker+Valid, 9291 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:35,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13747 Valid, 9291 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:02:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3770 states. [2025-03-03 16:02:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3770 to 3736. [2025-03-03 16:02:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3734 states have (on average 1.4081414033208355) internal successors, (5258), 3735 states have internal predecessors, (5258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 5258 transitions. [2025-03-03 16:02:35,223 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 5258 transitions. Word has length 61 [2025-03-03 16:02:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:35,224 INFO L471 AbstractCegarLoop]: Abstraction has 3736 states and 5258 transitions. [2025-03-03 16:02:35,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 5258 transitions. [2025-03-03 16:02:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 16:02:35,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:35,226 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] [2025-03-03 16:02:35,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:02:35,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 16:02:35,427 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:35,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash -250404215, now seen corresponding path program 1 times [2025-03-03 16:02:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:35,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284488424] [2025-03-03 16:02:35,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:35,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:02:35,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:02:35,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:35,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:35,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284488424] [2025-03-03 16:02:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284488424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197031237] [2025-03-03 16:02:35,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:35,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:35,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:35,731 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 16:02:35,733 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 16:02:35,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:02:35,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:02:35,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:35,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:35,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 16:02:35,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:37,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197031237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:39,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:39,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 18] total 40 [2025-03-03 16:02:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507050563] [2025-03-03 16:02:39,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 16:02:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:39,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 16:02:39,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 16:02:39,049 INFO L87 Difference]: Start difference. First operand 3736 states and 5258 transitions. Second operand has 40 states, 40 states have (on average 4.15) internal successors, (166), 40 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:55,193 INFO L93 Difference]: Finished difference Result 13867 states and 17969 transitions. [2025-03-03 16:02:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-03-03 16:02:55,194 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.15) internal successors, (166), 40 states have internal predecessors, (166), 0 states have call successors, (0), 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 62 [2025-03-03 16:02:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:55,209 INFO L225 Difference]: With dead ends: 13867 [2025-03-03 16:02:55,209 INFO L226 Difference]: Without dead ends: 11753 [2025-03-03 16:02:55,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8963 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=4721, Invalid=20401, Unknown=0, NotChecked=0, Total=25122 [2025-03-03 16:02:55,216 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 16754 mSDsluCounter, 17752 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16754 SdHoareTripleChecker+Valid, 19279 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:55,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16754 Valid, 19279 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:02:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11753 states. [2025-03-03 16:02:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11753 to 8775. [2025-03-03 16:02:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8775 states, 8773 states have (on average 1.3025190926706942) internal successors, (11427), 8774 states have internal predecessors, (11427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 11427 transitions. [2025-03-03 16:02:55,503 INFO L78 Accepts]: Start accepts. Automaton has 8775 states and 11427 transitions. Word has length 62 [2025-03-03 16:02:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:55,504 INFO L471 AbstractCegarLoop]: Abstraction has 8775 states and 11427 transitions. [2025-03-03 16:02:55,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.15) internal successors, (166), 40 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8775 states and 11427 transitions. [2025-03-03 16:02:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:02:55,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:55,505 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:55,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:02:55,709 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,SelfDestructingSolverStorable16 [2025-03-03 16:02:55,709 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -741574655, now seen corresponding path program 1 times [2025-03-03 16:02:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:55,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255719936] [2025-03-03 16:02:55,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:55,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:02:55,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:02:55,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255719936] [2025-03-03 16:02:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255719936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371410003] [2025-03-03 16:02:55,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:55,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:55,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:55,931 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 16:02:55,933 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 16:02:55,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:02:56,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:02:56,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:56,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:56,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:02:56,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:56,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371410003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:56,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:56,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-03 16:02:56,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884334984] [2025-03-03 16:02:56,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:56,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:02:56,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:56,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:02:56,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:02:56,599 INFO L87 Difference]: Start difference. First operand 8775 states and 11427 transitions. Second operand has 22 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:57,041 INFO L93 Difference]: Finished difference Result 15693 states and 20000 transitions. [2025-03-03 16:02:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:02:57,042 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 0 states have call successors, (0), 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 63 [2025-03-03 16:02:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:57,086 INFO L225 Difference]: With dead ends: 15693 [2025-03-03 16:02:57,086 INFO L226 Difference]: Without dead ends: 8899 [2025-03-03 16:02:57,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 16:02:57,090 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 16329 mSDsluCounter, 6147 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16329 SdHoareTripleChecker+Valid, 7653 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:57,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16329 Valid, 7653 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:02:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8899 states. [2025-03-03 16:02:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8899 to 8703. [2025-03-03 16:02:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8703 states, 8701 states have (on average 1.2969773589242615) internal successors, (11285), 8702 states have internal predecessors, (11285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 11285 transitions. [2025-03-03 16:02:57,310 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 11285 transitions. Word has length 63 [2025-03-03 16:02:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:57,310 INFO L471 AbstractCegarLoop]: Abstraction has 8703 states and 11285 transitions. [2025-03-03 16:02:57,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 11285 transitions. [2025-03-03 16:02:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 16:02:57,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:57,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:57,317 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 16:02:57,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:02:57,512 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1529122167, now seen corresponding path program 1 times [2025-03-03 16:02:57,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:57,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036465128] [2025-03-03 16:02:57,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:57,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:57,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 16:02:57,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 16:02:57,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:57,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:58,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036465128] [2025-03-03 16:02:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036465128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467186045] [2025-03-03 16:02:58,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:58,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:58,159 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 16:02:58,160 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 16:02:58,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 16:02:58,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 16:02:58,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:58,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:58,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-03 16:02:58,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:03:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:01,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:03:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467186045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:03:03,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:03:03,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 20] total 48 [2025-03-03 16:03:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33943028] [2025-03-03 16:03:03,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:03:03,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 16:03:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:03:03,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 16:03:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 16:03:03,467 INFO L87 Difference]: Start difference. First operand 8703 states and 11285 transitions. Second operand has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:03:19,973 INFO L93 Difference]: Finished difference Result 21327 states and 26840 transitions. [2025-03-03 16:03:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2025-03-03 16:03:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 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 64 [2025-03-03 16:03:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:03:19,997 INFO L225 Difference]: With dead ends: 21327 [2025-03-03 16:03:19,997 INFO L226 Difference]: Without dead ends: 17563 [2025-03-03 16:03:20,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12471 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=5885, Invalid=27421, Unknown=0, NotChecked=0, Total=33306 [2025-03-03 16:03:20,008 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 20759 mSDsluCounter, 25219 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20759 SdHoareTripleChecker+Valid, 26743 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:03:20,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20759 Valid, 26743 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 16:03:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17563 states. [2025-03-03 16:03:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17563 to 8225. [2025-03-03 16:03:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8225 states, 8223 states have (on average 1.3041469050224979) internal successors, (10724), 8224 states have internal predecessors, (10724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8225 states to 8225 states and 10724 transitions. [2025-03-03 16:03:20,352 INFO L78 Accepts]: Start accepts. Automaton has 8225 states and 10724 transitions. Word has length 64 [2025-03-03 16:03:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:03:20,352 INFO L471 AbstractCegarLoop]: Abstraction has 8225 states and 10724 transitions. [2025-03-03 16:03:20,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8225 states and 10724 transitions. [2025-03-03 16:03:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 16:03:20,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:03:20,354 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:03:20,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:03:20,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:03:20,554 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:03:20,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:03:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1952507066, now seen corresponding path program 1 times [2025-03-03 16:03:20,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:03:20,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650599391] [2025-03-03 16:03:20,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:20,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:03:20,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:03:20,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:03:20,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:20,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:20,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:03:20,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650599391] [2025-03-03 16:03:20,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650599391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:03:20,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:03:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:03:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088526300] [2025-03-03 16:03:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:03:20,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:03:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:03:20,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:03:20,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:03:20,611 INFO L87 Difference]: Start difference. First operand 8225 states and 10724 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:03:23,293 INFO L93 Difference]: Finished difference Result 11231 states and 15651 transitions. [2025-03-03 16:03:23,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:03:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 16:03:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:03:23,307 INFO L225 Difference]: With dead ends: 11231 [2025-03-03 16:03:23,307 INFO L226 Difference]: Without dead ends: 9727 [2025-03-03 16:03:23,312 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 16:03:23,312 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 753 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:03:23,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1301 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 16:03:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9727 states. [2025-03-03 16:03:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9727 to 9727. [2025-03-03 16:03:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9727 states, 9725 states have (on average 1.324421593830334) internal successors, (12880), 9726 states have internal predecessors, (12880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 12880 transitions. [2025-03-03 16:03:23,628 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 12880 transitions. Word has length 87 [2025-03-03 16:03:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:03:23,628 INFO L471 AbstractCegarLoop]: Abstraction has 9727 states and 12880 transitions. [2025-03-03 16:03:23,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 12880 transitions. [2025-03-03 16:03:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:03:23,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:03:23,629 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:03:23,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:03:23,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:03:23,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:03:23,630 INFO L85 PathProgramCache]: Analyzing trace with hash 861148964, now seen corresponding path program 1 times [2025-03-03 16:03:23,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:03:23,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174074362] [2025-03-03 16:03:23,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:03:23,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:03:23,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:03:23,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:23,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:23,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:03:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174074362] [2025-03-03 16:03:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174074362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:03:23,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:03:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:03:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779977869] [2025-03-03 16:03:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:03:23,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:03:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:03:23,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:03:23,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:03:23,680 INFO L87 Difference]: Start difference. First operand 9727 states and 12880 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:03:26,141 INFO L93 Difference]: Finished difference Result 15737 states and 22119 transitions. [2025-03-03 16:03:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:03:26,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 16:03:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:03:26,153 INFO L225 Difference]: With dead ends: 15737 [2025-03-03 16:03:26,153 INFO L226 Difference]: Without dead ends: 12731 [2025-03-03 16:03:26,159 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 16:03:26,160 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 846 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:03:26,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 519 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 16:03:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2025-03-03 16:03:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2025-03-03 16:03:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12731 states, 12729 states have (on average 1.2969596983266556) internal successors, (16509), 12730 states have internal predecessors, (16509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 16509 transitions. [2025-03-03 16:03:26,501 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 16509 transitions. Word has length 90 [2025-03-03 16:03:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:03:26,502 INFO L471 AbstractCegarLoop]: Abstraction has 12731 states and 16509 transitions. [2025-03-03 16:03:26,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 16509 transitions. [2025-03-03 16:03:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 16:03:26,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:03:26,503 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:03:26,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:03:26,503 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:03:26,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:03:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash -338233773, now seen corresponding path program 1 times [2025-03-03 16:03:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:03:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782326760] [2025-03-03 16:03:26,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:03:26,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 16:03:26,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 16:03:26,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:26,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:26,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:03:26,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782326760] [2025-03-03 16:03:26,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782326760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:03:26,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:03:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:03:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616927908] [2025-03-03 16:03:26,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:03:26,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:03:26,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:03:26,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:03:26,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:03:26,620 INFO L87 Difference]: Start difference. First operand 12731 states and 16509 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:03:29,002 INFO L93 Difference]: Finished difference Result 19492 states and 25629 transitions. [2025-03-03 16:03:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:03:29,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-03 16:03:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:03:29,016 INFO L225 Difference]: With dead ends: 19492 [2025-03-03 16:03:29,016 INFO L226 Difference]: Without dead ends: 13482 [2025-03-03 16:03:29,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:03:29,023 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 956 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:03:29,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1313 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 16:03:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13482 states. [2025-03-03 16:03:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13482 to 13482. [2025-03-03 16:03:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13482 states, 13480 states have (on average 1.280860534124629) internal successors, (17266), 13481 states have internal predecessors, (17266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13482 states to 13482 states and 17266 transitions. [2025-03-03 16:03:29,469 INFO L78 Accepts]: Start accepts. Automaton has 13482 states and 17266 transitions. Word has length 97 [2025-03-03 16:03:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:03:29,469 INFO L471 AbstractCegarLoop]: Abstraction has 13482 states and 17266 transitions. [2025-03-03 16:03:29,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 13482 states and 17266 transitions. [2025-03-03 16:03:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:03:29,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:03:29,471 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:03:29,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:03:29,471 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:03:29,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:03:29,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1114355365, now seen corresponding path program 1 times [2025-03-03 16:03:29,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:03:29,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788653328] [2025-03-03 16:03:29,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:03:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:03:29,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:03:29,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:29,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 26 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:30,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:03:30,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788653328] [2025-03-03 16:03:30,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788653328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:03:30,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736456902] [2025-03-03 16:03:30,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:30,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:03:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:03:30,415 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 16:03:30,415 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 16:03:30,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:03:30,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:03:30,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:30,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:30,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 16:03:30,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:03:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 44 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:31,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:03:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 35 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:32,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736456902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:03:32,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:03:32,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 40 [2025-03-03 16:03:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998103980] [2025-03-03 16:03:32,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:03:32,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 16:03:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:03:32,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 16:03:32,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1419, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 16:03:32,628 INFO L87 Difference]: Start difference. First operand 13482 states and 17266 transitions. Second operand has 40 states, 40 states have (on average 7.0) internal successors, (280), 40 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:03:37,266 INFO L93 Difference]: Finished difference Result 22191 states and 27916 transitions. [2025-03-03 16:03:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-03 16:03:37,267 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.0) internal successors, (280), 40 states have internal predecessors, (280), 0 states have call successors, (0), 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 104 [2025-03-03 16:03:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:03:37,283 INFO L225 Difference]: With dead ends: 22191 [2025-03-03 16:03:37,283 INFO L226 Difference]: Without dead ends: 18836 [2025-03-03 16:03:37,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2224, Invalid=8488, Unknown=0, NotChecked=0, Total=10712 [2025-03-03 16:03:37,289 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 25165 mSDsluCounter, 19921 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25165 SdHoareTripleChecker+Valid, 21440 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:03:37,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25165 Valid, 21440 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:03:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18836 states. [2025-03-03 16:03:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18836 to 13903. [2025-03-03 16:03:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13903 states, 13901 states have (on average 1.2732177541184087) internal successors, (17699), 13902 states have internal predecessors, (17699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13903 states to 13903 states and 17699 transitions. [2025-03-03 16:03:37,755 INFO L78 Accepts]: Start accepts. Automaton has 13903 states and 17699 transitions. Word has length 104 [2025-03-03 16:03:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:03:37,755 INFO L471 AbstractCegarLoop]: Abstraction has 13903 states and 17699 transitions. [2025-03-03 16:03:37,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.0) internal successors, (280), 40 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13903 states and 17699 transitions. [2025-03-03 16:03:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:03:37,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:03:37,757 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:03:37,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 16:03:37,957 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,SelfDestructingSolverStorable22 [2025-03-03 16:03:37,957 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:03:37,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:03:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash -18227173, now seen corresponding path program 1 times [2025-03-03 16:03:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:03:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62567883] [2025-03-03 16:03:37,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:03:37,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:03:37,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:03:37,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:37,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:38,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:03:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62567883] [2025-03-03 16:03:38,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62567883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:03:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928371050] [2025-03-03 16:03:38,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:38,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:03:38,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:03:38,539 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 16:03:38,543 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 16:03:38,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:03:38,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:03:38,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:38,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:38,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 16:03:38,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:03:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 27 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:39,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:03:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:40,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928371050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:03:40,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:03:40,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 36 [2025-03-03 16:03:40,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276085913] [2025-03-03 16:03:40,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:03:40,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 16:03:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:03:40,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 16:03:40,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 16:03:40,340 INFO L87 Difference]: Start difference. First operand 13903 states and 17699 transitions. Second operand has 36 states, 36 states have (on average 7.833333333333333) internal successors, (282), 36 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)