./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.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.6.ufo.UNBOUNDED.pals+Problem12_label07.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 2ebc8d28b42c51bdeaffef49b8259d7ab2c7e002b024bef1fa6cab620a98975e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:13:57,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:13:58,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:13:58,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:13:58,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:13:58,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:13:58,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:13:58,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:13:58,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:13:58,071 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:13:58,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:13:58,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:13:58,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:13:58,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:13:58,072 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:13:58,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:13:58,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:13:58,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:13:58,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:13:58,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:13:58,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:13:58,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:13:58,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:13:58,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:13:58,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:13:58,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:13:58,075 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 -> 2ebc8d28b42c51bdeaffef49b8259d7ab2c7e002b024bef1fa6cab620a98975e [2025-03-03 16:13:58,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:13:58,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:13:58,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:13:58,281 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:13:58,281 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:13:58,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-03 16:13:59,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83556ecf/2ce97fadbf7947c89e7acfed8d658213/FLAG2f934ae45 [2025-03-03 16:13:59,892 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:13:59,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-03 16:13:59,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83556ecf/2ce97fadbf7947c89e7acfed8d658213/FLAG2f934ae45 [2025-03-03 16:14:00,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83556ecf/2ce97fadbf7947c89e7acfed8d658213 [2025-03-03 16:14:00,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:14:00,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:14:00,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:14:00,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:14:00,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:14:00,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:14:00" (1/1) ... [2025-03-03 16:14:00,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfa26d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:00, skipping insertion in model container [2025-03-03 16:14:00,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:14:00" (1/1) ... [2025-03-03 16:14:00,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:14:00,460 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.6.ufo.UNBOUNDED.pals+Problem12_label07.c[15510,15523] [2025-03-03 16:14:00,491 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.6.ufo.UNBOUNDED.pals+Problem12_label07.c[16352,16365] [2025-03-03 16:14:00,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:14:00,936 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:14:00,963 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.6.ufo.UNBOUNDED.pals+Problem12_label07.c[15510,15523] [2025-03-03 16:14:00,965 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.6.ufo.UNBOUNDED.pals+Problem12_label07.c[16352,16365] [2025-03-03 16:14:01,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:14:01,252 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:14:01,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01 WrapperNode [2025-03-03 16:14:01,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:14:01,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:14:01,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:14:01,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:14:01,259 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:14:01" (1/1) ... [2025-03-03 16:14:01,296 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:14:01" (1/1) ... [2025-03-03 16:14:01,543 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5151 [2025-03-03 16:14:01,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:14:01,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:14:01,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:14:01,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:14:01,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,735 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:14:01,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:14:01,935 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:14:01,935 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:14:01,935 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:14:01,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (1/1) ... [2025-03-03 16:14:01,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:14:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:01,959 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:14:01,961 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:14:01,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:14:01,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:14:01,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:14:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:14:02,069 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:14:02,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:14:05,389 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3685: havoc calculate_output2_#t~ret42#1; [2025-03-03 16:14:05,389 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5175: havoc calculate_output3_#t~ret43#1; [2025-03-03 16:14:05,389 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc calculate_output_#t~ret41#1; [2025-03-03 16:14:05,527 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-03-03 16:14:05,528 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:14:05,563 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:14:05,563 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:14:05,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:14:05 BoogieIcfgContainer [2025-03-03 16:14:05,563 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:14:05,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:14:05,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:14:05,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:14:05,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:14:00" (1/3) ... [2025-03-03 16:14:05,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ad9ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:14:05, skipping insertion in model container [2025-03-03 16:14:05,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:01" (2/3) ... [2025-03-03 16:14:05,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ad9ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:14:05, skipping insertion in model container [2025-03-03 16:14:05,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:14:05" (3/3) ... [2025-03-03 16:14:05,574 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-03 16:14:05,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:14:05,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c that has 1 procedures, 915 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:14:05,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:14:05,661 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;@58e56d81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:14:05,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:14:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states 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:14:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 16:14:05,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:05,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:05,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:05,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2017331273, now seen corresponding path program 1 times [2025-03-03 16:14:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:05,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770165676] [2025-03-03 16:14:05,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:05,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 16:14:05,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 16:14:05,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:05,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:05,870 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:14:05,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:05,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770165676] [2025-03-03 16:14:05,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770165676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:05,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:05,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:14:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455712351] [2025-03-03 16:14:05,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:05,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:05,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:05,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:05,896 INFO L87 Difference]: Start difference. First operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:14:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:09,011 INFO L93 Difference]: Finished difference Result 2538 states and 4882 transitions. [2025-03-03 16:14:09,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:09,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-03 16:14:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:09,033 INFO L225 Difference]: With dead ends: 2538 [2025-03-03 16:14:09,034 INFO L226 Difference]: Without dead ends: 1601 [2025-03-03 16:14:09,038 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:14:09,039 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1019 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:09,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 270 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 16:14:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-03-03 16:14:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2025-03-03 16:14:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1599 states have (on average 1.8636647904940589) internal successors, (2980), 1600 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states 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:14:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2980 transitions. [2025-03-03 16:14:09,127 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2980 transitions. Word has length 7 [2025-03-03 16:14:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:09,127 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2980 transitions. [2025-03-03 16:14:09,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:14:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2980 transitions. [2025-03-03 16:14:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:14:09,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:09,128 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] [2025-03-03 16:14:09,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:14:09,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:09,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2146927058, now seen corresponding path program 1 times [2025-03-03 16:14:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:09,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551347699] [2025-03-03 16:14:09,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:09,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:14:09,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:14:09,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:09,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:09,341 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:14:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551347699] [2025-03-03 16:14:09,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551347699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:09,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:09,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:14:09,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124453126] [2025-03-03 16:14:09,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:09,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:14:09,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:09,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:14:09,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:14:09,343 INFO L87 Difference]: Start difference. First operand 1601 states and 2980 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:14:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:09,401 INFO L93 Difference]: Finished difference Result 1655 states and 3064 transitions. [2025-03-03 16:14:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:14:09,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 16:14:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:09,407 INFO L225 Difference]: With dead ends: 1655 [2025-03-03 16:14:09,408 INFO L226 Difference]: Without dead ends: 1601 [2025-03-03 16:14:09,408 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:14:09,409 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6367 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:09,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6367 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-03-03 16:14:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2025-03-03 16:14:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1599 states have (on average 1.8386491557223263) internal successors, (2940), 1600 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states 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:14:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2940 transitions. [2025-03-03 16:14:09,439 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2940 transitions. Word has length 26 [2025-03-03 16:14:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:09,439 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2940 transitions. [2025-03-03 16:14:09,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:14:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2940 transitions. [2025-03-03 16:14:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:14:09,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:09,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:09,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:14:09,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:09,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1878112614, now seen corresponding path program 1 times [2025-03-03 16:14:09,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:09,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095780582] [2025-03-03 16:14:09,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:09,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:09,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:14:09,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:14:09,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:09,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:09,675 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:14:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095780582] [2025-03-03 16:14:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095780582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:09,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202062157] [2025-03-03 16:14:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:09,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:09,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:09,678 INFO L87 Difference]: Start difference. First operand 1601 states and 2940 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:14:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:09,913 INFO L93 Difference]: Finished difference Result 2201 states and 3900 transitions. [2025-03-03 16:14:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:14:09,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 16:14:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:09,922 INFO L225 Difference]: With dead ends: 2201 [2025-03-03 16:14:09,922 INFO L226 Difference]: Without dead ends: 2151 [2025-03-03 16:14:09,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:14:09,923 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 9729 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9729 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:09,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9729 Valid, 3527 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2025-03-03 16:14:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1649. [2025-03-03 16:14:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1647 states have (on average 1.8318154219793563) internal successors, (3017), 1648 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states 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:14:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 3017 transitions. [2025-03-03 16:14:09,957 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 3017 transitions. Word has length 65 [2025-03-03 16:14:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:09,958 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 3017 transitions. [2025-03-03 16:14:09,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:14:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 3017 transitions. [2025-03-03 16:14:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:14:09,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:09,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:09,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:14:09,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:09,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash 140395509, now seen corresponding path program 1 times [2025-03-03 16:14:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:09,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840374577] [2025-03-03 16:14:09,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:09,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:09,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:14:09,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:14:09,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:09,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:10,085 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:14:10,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:10,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840374577] [2025-03-03 16:14:10,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840374577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:10,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:10,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:10,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965374966] [2025-03-03 16:14:10,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:10,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:10,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:10,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:10,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:10,088 INFO L87 Difference]: Start difference. First operand 1649 states and 3017 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:14:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:10,125 INFO L93 Difference]: Finished difference Result 1834 states and 3312 transitions. [2025-03-03 16:14:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:10,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-03 16:14:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:10,131 INFO L225 Difference]: With dead ends: 1834 [2025-03-03 16:14:10,132 INFO L226 Difference]: Without dead ends: 1736 [2025-03-03 16:14:10,132 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:14:10,134 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1492 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1634 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:14:10,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1634 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-03-03 16:14:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1732. [2025-03-03 16:14:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.8190751445086706) internal successors, (3147), 1731 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states 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:14:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 3147 transitions. [2025-03-03 16:14:10,168 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 3147 transitions. Word has length 67 [2025-03-03 16:14:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:10,170 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 3147 transitions. [2025-03-03 16:14:10,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:14:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 3147 transitions. [2025-03-03 16:14:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:14:10,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:10,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:10,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:14:10,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:10,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash 172718744, now seen corresponding path program 1 times [2025-03-03 16:14:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:10,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696400627] [2025-03-03 16:14:10,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:10,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:10,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:14:10,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:14:10,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:10,436 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:14:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696400627] [2025-03-03 16:14:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696400627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:10,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:10,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172731431] [2025-03-03 16:14:10,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:10,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:10,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:10,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:10,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:10,437 INFO L87 Difference]: Start difference. First operand 1732 states and 3147 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:14:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:10,617 INFO L93 Difference]: Finished difference Result 1915 states and 3435 transitions. [2025-03-03 16:14:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:10,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-03 16:14:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:10,624 INFO L225 Difference]: With dead ends: 1915 [2025-03-03 16:14:10,624 INFO L226 Difference]: Without dead ends: 1734 [2025-03-03 16:14:10,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:14:10,625 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 4525 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:10,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 1941 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-03-03 16:14:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2025-03-03 16:14:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.8179190751445087) internal successors, (3145), 1731 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states 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:14:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 3145 transitions. [2025-03-03 16:14:10,655 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 3145 transitions. Word has length 67 [2025-03-03 16:14:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:10,656 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 3145 transitions. [2025-03-03 16:14:10,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:14:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 3145 transitions. [2025-03-03 16:14:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:14:10,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:10,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:10,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:14:10,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:10,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1089851502, now seen corresponding path program 1 times [2025-03-03 16:14:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:10,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422522438] [2025-03-03 16:14:10,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:10,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:14:10,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:14:10,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:10,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:10,879 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:14:10,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422522438] [2025-03-03 16:14:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422522438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:10,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32473234] [2025-03-03 16:14:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:10,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:10,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:10,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:10,883 INFO L87 Difference]: Start difference. First operand 1732 states and 3145 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:14:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:10,994 INFO L93 Difference]: Finished difference Result 1740 states and 3154 transitions. [2025-03-03 16:14:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:10,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-03 16:14:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:11,002 INFO L225 Difference]: With dead ends: 1740 [2025-03-03 16:14:11,002 INFO L226 Difference]: Without dead ends: 1738 [2025-03-03 16:14:11,003 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:14:11,004 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 0 mSDsluCounter, 9341 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10900 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:11,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10900 Invalid, 51 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2025-03-03 16:14:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2025-03-03 16:14:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1736 states have (on average 1.814516129032258) internal successors, (3150), 1737 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states 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:14:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 3150 transitions. [2025-03-03 16:14:11,039 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 3150 transitions. Word has length 68 [2025-03-03 16:14:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:11,040 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 3150 transitions. [2025-03-03 16:14:11,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:14:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 3150 transitions. [2025-03-03 16:14:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:11,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:11,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:11,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:14:11,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:11,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1188896010, now seen corresponding path program 1 times [2025-03-03 16:14:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:11,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206486335] [2025-03-03 16:14:11,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:11,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:11,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:11,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:11,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:11,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:11,101 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:14:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206486335] [2025-03-03 16:14:11,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206486335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:11,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:11,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035259896] [2025-03-03 16:14:11,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:11,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:11,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:11,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:11,103 INFO L87 Difference]: Start difference. First operand 1738 states and 3150 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:11,133 INFO L93 Difference]: Finished difference Result 2096 states and 3702 transitions. [2025-03-03 16:14:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:11,140 INFO L225 Difference]: With dead ends: 2096 [2025-03-03 16:14:11,140 INFO L226 Difference]: Without dead ends: 1909 [2025-03-03 16:14:11,141 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:14:11,141 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1507 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1707 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:14:11,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2025-03-03 16:14:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1907. [2025-03-03 16:14:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1905 states have (on average 1.7884514435695538) internal successors, (3407), 1906 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states 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:14:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 3407 transitions. [2025-03-03 16:14:11,173 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 3407 transitions. Word has length 69 [2025-03-03 16:14:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:11,173 INFO L471 AbstractCegarLoop]: Abstraction has 1907 states and 3407 transitions. [2025-03-03 16:14:11,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 3407 transitions. [2025-03-03 16:14:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:11,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:11,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:11,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:14:11,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:11,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:11,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2127140790, now seen corresponding path program 1 times [2025-03-03 16:14:11,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:11,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452566726] [2025-03-03 16:14:11,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:11,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:11,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:11,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:11,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:11,224 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:14:11,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:11,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452566726] [2025-03-03 16:14:11,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452566726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:11,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:11,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:11,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678316823] [2025-03-03 16:14:11,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:11,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:11,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:11,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:11,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:11,225 INFO L87 Difference]: Start difference. First operand 1907 states and 3407 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:11,257 INFO L93 Difference]: Finished difference Result 2587 states and 4445 transitions. [2025-03-03 16:14:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:11,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:11,264 INFO L225 Difference]: With dead ends: 2587 [2025-03-03 16:14:11,264 INFO L226 Difference]: Without dead ends: 2231 [2025-03-03 16:14:11,265 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:14:11,266 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1505 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1709 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:14:11,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-03-03 16:14:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2229. [2025-03-03 16:14:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2227 states have (on average 1.7462954647507858) internal successors, (3889), 2228 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states 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:14:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 3889 transitions. [2025-03-03 16:14:11,307 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 3889 transitions. Word has length 69 [2025-03-03 16:14:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:11,307 INFO L471 AbstractCegarLoop]: Abstraction has 2229 states and 3889 transitions. [2025-03-03 16:14:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 3889 transitions. [2025-03-03 16:14:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:11,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:11,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:11,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:14:11,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1679195254, now seen corresponding path program 1 times [2025-03-03 16:14:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860183423] [2025-03-03 16:14:11,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:11,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:11,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:11,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:11,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:11,357 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:14:11,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:11,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860183423] [2025-03-03 16:14:11,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860183423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:11,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:11,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:11,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455583671] [2025-03-03 16:14:11,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:11,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:11,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:11,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:11,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:11,358 INFO L87 Difference]: Start difference. First operand 2229 states and 3889 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:11,395 INFO L93 Difference]: Finished difference Result 3521 states and 5835 transitions. [2025-03-03 16:14:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:11,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:11,405 INFO L225 Difference]: With dead ends: 3521 [2025-03-03 16:14:11,405 INFO L226 Difference]: Without dead ends: 2843 [2025-03-03 16:14:11,407 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:14:11,407 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1503 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1711 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:14:11,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1711 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2025-03-03 16:14:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2841. [2025-03-03 16:14:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2839 states have (on average 1.6868615709756956) internal successors, (4789), 2840 states have internal predecessors, (4789), 0 states have call successors, (0), 0 states 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:14:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 4789 transitions. [2025-03-03 16:14:11,457 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 4789 transitions. Word has length 69 [2025-03-03 16:14:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:11,457 INFO L471 AbstractCegarLoop]: Abstraction has 2841 states and 4789 transitions. [2025-03-03 16:14:11,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 4789 transitions. [2025-03-03 16:14:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:11,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:11,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:14:11,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2094371126, now seen corresponding path program 1 times [2025-03-03 16:14:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881777064] [2025-03-03 16:14:11,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:11,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:11,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:11,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:11,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:11,504 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:14:11,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:11,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881777064] [2025-03-03 16:14:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881777064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:11,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:11,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657257360] [2025-03-03 16:14:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:11,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:11,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:11,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:11,506 INFO L87 Difference]: Start difference. First operand 2841 states and 4789 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:11,554 INFO L93 Difference]: Finished difference Result 5293 states and 8423 transitions. [2025-03-03 16:14:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:11,565 INFO L225 Difference]: With dead ends: 5293 [2025-03-03 16:14:11,566 INFO L226 Difference]: Without dead ends: 4003 [2025-03-03 16:14:11,568 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:14:11,569 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1501 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1713 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:14:11,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1713 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2025-03-03 16:14:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 4001. [2025-03-03 16:14:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 3999 states have (on average 1.6156539134783696) internal successors, (6461), 4000 states have internal predecessors, (6461), 0 states have call successors, (0), 0 states 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:14:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 6461 transitions. [2025-03-03 16:14:11,647 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 6461 transitions. Word has length 69 [2025-03-03 16:14:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:11,647 INFO L471 AbstractCegarLoop]: Abstraction has 4001 states and 6461 transitions. [2025-03-03 16:14:11,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 6461 transitions. [2025-03-03 16:14:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:11,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:11,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:11,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:14:11,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:11,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1607652854, now seen corresponding path program 1 times [2025-03-03 16:14:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660946997] [2025-03-03 16:14:11,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:11,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:11,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:11,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:11,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:11,696 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:14:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660946997] [2025-03-03 16:14:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660946997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76608026] [2025-03-03 16:14:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:11,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:11,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:11,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:11,697 INFO L87 Difference]: Start difference. First operand 4001 states and 6461 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:11,780 INFO L93 Difference]: Finished difference Result 8645 states and 13215 transitions. [2025-03-03 16:14:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:11,804 INFO L225 Difference]: With dead ends: 8645 [2025-03-03 16:14:11,806 INFO L226 Difference]: Without dead ends: 6195 [2025-03-03 16:14:11,811 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:14:11,812 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1499 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1715 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:14:11,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1715 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6195 states. [2025-03-03 16:14:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6195 to 6193. [2025-03-03 16:14:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6193 states, 6191 states have (on average 1.5424002584396705) internal successors, (9549), 6192 states have internal predecessors, (9549), 0 states have call successors, (0), 0 states 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:14:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6193 states to 6193 states and 9549 transitions. [2025-03-03 16:14:11,950 INFO L78 Accepts]: Start accepts. Automaton has 6193 states and 9549 transitions. Word has length 69 [2025-03-03 16:14:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:11,951 INFO L471 AbstractCegarLoop]: Abstraction has 6193 states and 9549 transitions. [2025-03-03 16:14:11,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:14:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 6193 states and 9549 transitions. [2025-03-03 16:14:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:14:11,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:11,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:11,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:14:11,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:11,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1834425366, now seen corresponding path program 1 times [2025-03-03 16:14:11,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:11,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364613657] [2025-03-03 16:14:11,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:11,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:14:11,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:14:11,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:11,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:11,996 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:14:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364613657] [2025-03-03 16:14:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364613657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952801166] [2025-03-03 16:14:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:11,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:11,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:11,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:11,998 INFO L87 Difference]: Start difference. First operand 6193 states and 9549 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:14:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:12,125 INFO L93 Difference]: Finished difference Result 11064 states and 16659 transitions. [2025-03-03 16:14:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-03 16:14:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:12,139 INFO L225 Difference]: With dead ends: 11064 [2025-03-03 16:14:12,139 INFO L226 Difference]: Without dead ends: 8437 [2025-03-03 16:14:12,143 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:14:12,144 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1506 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1708 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:14:12,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8437 states. [2025-03-03 16:14:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8437 to 8435. [2025-03-03 16:14:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8435 states, 8433 states have (on average 1.5082414324676865) internal successors, (12719), 8434 states have internal predecessors, (12719), 0 states have call successors, (0), 0 states 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:14:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8435 states to 8435 states and 12719 transitions. [2025-03-03 16:14:12,300 INFO L78 Accepts]: Start accepts. Automaton has 8435 states and 12719 transitions. Word has length 71 [2025-03-03 16:14:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:12,300 INFO L471 AbstractCegarLoop]: Abstraction has 8435 states and 12719 transitions. [2025-03-03 16:14:12,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:14:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8435 states and 12719 transitions. [2025-03-03 16:14:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:14:12,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:12,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:12,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:14:12,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:12,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1098558694, now seen corresponding path program 1 times [2025-03-03 16:14:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:12,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205362013] [2025-03-03 16:14:12,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:12,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:12,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:14:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:14:12,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:12,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:12,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205362013] [2025-03-03 16:14:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205362013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:12,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188517024] [2025-03-03 16:14:12,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:12,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:14:12,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:12,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:14:12,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:14:12,429 INFO L87 Difference]: Start difference. First operand 8435 states and 12719 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:14:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:16,285 INFO L93 Difference]: Finished difference Result 12200 states and 19725 transitions. [2025-03-03 16:14:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:14:16,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 16:14:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:16,304 INFO L225 Difference]: With dead ends: 12200 [2025-03-03 16:14:16,305 INFO L226 Difference]: Without dead ends: 10696 [2025-03-03 16:14:16,308 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:14:16,308 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 2547 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2547 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:16,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2547 Valid, 325 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 16:14:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10696 states. [2025-03-03 16:14:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10696 to 10688. [2025-03-03 16:14:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10688 states, 10686 states have (on average 1.4938236945536216) internal successors, (15963), 10687 states have internal predecessors, (15963), 0 states have call successors, (0), 0 states 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:14:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10688 states to 10688 states and 15963 transitions. [2025-03-03 16:14:16,496 INFO L78 Accepts]: Start accepts. Automaton has 10688 states and 15963 transitions. Word has length 80 [2025-03-03 16:14:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:16,497 INFO L471 AbstractCegarLoop]: Abstraction has 10688 states and 15963 transitions. [2025-03-03 16:14:16,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:14:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10688 states and 15963 transitions. [2025-03-03 16:14:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:16,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:16,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:16,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:14:16,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:16,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:16,499 INFO L85 PathProgramCache]: Analyzing trace with hash -65687301, now seen corresponding path program 1 times [2025-03-03 16:14:16,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:16,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624798984] [2025-03-03 16:14:16,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:16,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:16,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:16,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:16,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:16,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:14:16,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:16,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624798984] [2025-03-03 16:14:16,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624798984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:16,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278286335] [2025-03-03 16:14:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:16,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:16,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:16,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:16,697 INFO L87 Difference]: Start difference. First operand 10688 states and 15963 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:14:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:17,375 INFO L93 Difference]: Finished difference Result 53422 states and 77090 transitions. [2025-03-03 16:14:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:17,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 90 [2025-03-03 16:14:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:17,449 INFO L225 Difference]: With dead ends: 53422 [2025-03-03 16:14:17,449 INFO L226 Difference]: Without dead ends: 46540 [2025-03-03 16:14:17,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:14:17,470 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 8048 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8048 SdHoareTripleChecker+Valid, 4074 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:17,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8048 Valid, 4074 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46540 states. [2025-03-03 16:14:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46540 to 17568. [2025-03-03 16:14:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17568 states, 17566 states have (on average 1.4643629739269042) internal successors, (25723), 17567 states have internal predecessors, (25723), 0 states have call successors, (0), 0 states 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:14:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17568 states to 17568 states and 25723 transitions. [2025-03-03 16:14:18,000 INFO L78 Accepts]: Start accepts. Automaton has 17568 states and 25723 transitions. Word has length 90 [2025-03-03 16:14:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:18,000 INFO L471 AbstractCegarLoop]: Abstraction has 17568 states and 25723 transitions. [2025-03-03 16:14:18,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:14:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 17568 states and 25723 transitions. [2025-03-03 16:14:18,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:18,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:18,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:18,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:14:18,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:18,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:18,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1044617797, now seen corresponding path program 1 times [2025-03-03 16:14:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:18,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172870478] [2025-03-03 16:14:18,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:18,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:18,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:18,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:18,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:18,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:14:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:18,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172870478] [2025-03-03 16:14:18,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172870478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:18,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:18,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:18,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585236561] [2025-03-03 16:14:18,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:18,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:18,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:18,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:18,151 INFO L87 Difference]: Start difference. First operand 17568 states and 25723 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:14:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:18,945 INFO L93 Difference]: Finished difference Result 60302 states and 86850 transitions. [2025-03-03 16:14:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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:14:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:19,032 INFO L225 Difference]: With dead ends: 60302 [2025-03-03 16:14:19,033 INFO L226 Difference]: Without dead ends: 53420 [2025-03-03 16:14:19,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:14:19,056 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8073 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8073 SdHoareTripleChecker+Valid, 3964 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:19,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8073 Valid, 3964 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53420 states. [2025-03-03 16:14:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53420 to 27904. [2025-03-03 16:14:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27904 states, 27902 states have (on average 1.4437316321410651) internal successors, (40283), 27903 states have internal predecessors, (40283), 0 states have call successors, (0), 0 states 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:14:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27904 states to 27904 states and 40283 transitions. [2025-03-03 16:14:19,743 INFO L78 Accepts]: Start accepts. Automaton has 27904 states and 40283 transitions. Word has length 90 [2025-03-03 16:14:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:19,743 INFO L471 AbstractCegarLoop]: Abstraction has 27904 states and 40283 transitions. [2025-03-03 16:14:19,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:14:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27904 states and 40283 transitions. [2025-03-03 16:14:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:19,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:19,747 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:19,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:14:19,747 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:19,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1492563333, now seen corresponding path program 1 times [2025-03-03 16:14:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060113193] [2025-03-03 16:14:19,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:19,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:14:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060113193] [2025-03-03 16:14:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060113193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062551759] [2025-03-03 16:14:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:19,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:19,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:19,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:19,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:19,931 INFO L87 Difference]: Start difference. First operand 27904 states and 40283 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:14:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:21,267 INFO L93 Difference]: Finished difference Result 67182 states and 96610 transitions. [2025-03-03 16:14:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:21,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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:14:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:21,345 INFO L225 Difference]: With dead ends: 67182 [2025-03-03 16:14:21,345 INFO L226 Difference]: Without dead ends: 60300 [2025-03-03 16:14:21,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:14:21,371 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 8118 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8118 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:21,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8118 Valid, 3892 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60300 states. [2025-03-03 16:14:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60300 to 34784. [2025-03-03 16:14:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34784 states, 34782 states have (on average 1.4387614283249957) internal successors, (50043), 34783 states have internal predecessors, (50043), 0 states have call successors, (0), 0 states 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:14:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34784 states to 34784 states and 50043 transitions. [2025-03-03 16:14:22,218 INFO L78 Accepts]: Start accepts. Automaton has 34784 states and 50043 transitions. Word has length 90 [2025-03-03 16:14:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:22,219 INFO L471 AbstractCegarLoop]: Abstraction has 34784 states and 50043 transitions. [2025-03-03 16:14:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:14:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 34784 states and 50043 transitions. [2025-03-03 16:14:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:22,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:22,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:22,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:14:22,223 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:22,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1077387461, now seen corresponding path program 1 times [2025-03-03 16:14:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:22,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617459860] [2025-03-03 16:14:22,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:22,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:22,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:22,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:22,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:22,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:14:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617459860] [2025-03-03 16:14:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617459860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121525166] [2025-03-03 16:14:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:22,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:22,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:22,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:22,368 INFO L87 Difference]: Start difference. First operand 34784 states and 50043 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:14:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:23,497 INFO L93 Difference]: Finished difference Result 74062 states and 106370 transitions. [2025-03-03 16:14:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:23,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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:14:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:23,585 INFO L225 Difference]: With dead ends: 74062 [2025-03-03 16:14:23,585 INFO L226 Difference]: Without dead ends: 67180 [2025-03-03 16:14:23,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:14:23,605 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 8168 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8168 SdHoareTripleChecker+Valid, 3896 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:23,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8168 Valid, 3896 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67180 states. [2025-03-03 16:14:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67180 to 41664. [2025-03-03 16:14:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41664 states, 41662 states have (on average 1.4354327684700687) internal successors, (59803), 41663 states have internal predecessors, (59803), 0 states have call successors, (0), 0 states 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:14:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41664 states to 41664 states and 59803 transitions. [2025-03-03 16:14:24,611 INFO L78 Accepts]: Start accepts. Automaton has 41664 states and 59803 transitions. Word has length 90 [2025-03-03 16:14:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:24,611 INFO L471 AbstractCegarLoop]: Abstraction has 41664 states and 59803 transitions. [2025-03-03 16:14:24,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:14:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 41664 states and 59803 transitions. [2025-03-03 16:14:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:24,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:24,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:14:24,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:24,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1564105733, now seen corresponding path program 1 times [2025-03-03 16:14:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612917637] [2025-03-03 16:14:24,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:24,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:24,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:24,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 16:14:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612917637] [2025-03-03 16:14:24,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612917637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:24,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:24,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845017264] [2025-03-03 16:14:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:24,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:24,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:24,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:24,748 INFO L87 Difference]: Start difference. First operand 41664 states and 59803 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:14:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:26,433 INFO L93 Difference]: Finished difference Result 80942 states and 116130 transitions. [2025-03-03 16:14:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:26,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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:14:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:26,527 INFO L225 Difference]: With dead ends: 80942 [2025-03-03 16:14:26,527 INFO L226 Difference]: Without dead ends: 74060 [2025-03-03 16:14:26,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:14:26,546 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8072 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8072 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:26,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8072 Valid, 3988 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74060 states. [2025-03-03 16:14:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74060 to 48544. [2025-03-03 16:14:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48544 states, 48542 states have (on average 1.433047670058918) internal successors, (69563), 48543 states have internal predecessors, (69563), 0 states have call successors, (0), 0 states 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:14:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48544 states to 48544 states and 69563 transitions. [2025-03-03 16:14:27,953 INFO L78 Accepts]: Start accepts. Automaton has 48544 states and 69563 transitions. Word has length 90 [2025-03-03 16:14:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:27,953 INFO L471 AbstractCegarLoop]: Abstraction has 48544 states and 69563 transitions. [2025-03-03 16:14:27,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:14:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 48544 states and 69563 transitions. [2025-03-03 16:14:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:14:27,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:27,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:27,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:14:27,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:27,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1843277639, now seen corresponding path program 1 times [2025-03-03 16:14:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589937939] [2025-03-03 16:14:27,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:27,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:14:27,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:14:27,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:27,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589937939] [2025-03-03 16:14:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589937939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202993266] [2025-03-03 16:14:28,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:28,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:28,056 INFO L87 Difference]: Start difference. First operand 48544 states and 69563 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:29,106 INFO L93 Difference]: Finished difference Result 80186 states and 114932 transitions. [2025-03-03 16:14:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:29,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 16:14:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:29,152 INFO L225 Difference]: With dead ends: 80186 [2025-03-03 16:14:29,153 INFO L226 Difference]: Without dead ends: 35448 [2025-03-03 16:14:29,175 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:14:29,176 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 58 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3163 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:14:29,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3163 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35448 states. [2025-03-03 16:14:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35448 to 35446. [2025-03-03 16:14:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35446 states, 35444 states have (on average 1.4404976864913666) internal successors, (51057), 35445 states have internal predecessors, (51057), 0 states have call successors, (0), 0 states 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:14:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35446 states to 35446 states and 51057 transitions. [2025-03-03 16:14:29,855 INFO L78 Accepts]: Start accepts. Automaton has 35446 states and 51057 transitions. Word has length 92 [2025-03-03 16:14:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 35446 states and 51057 transitions. [2025-03-03 16:14:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 35446 states and 51057 transitions. [2025-03-03 16:14:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:14:29,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:29,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:29,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:14:29,858 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:29,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1093763877, now seen corresponding path program 1 times [2025-03-03 16:14:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363808847] [2025-03-03 16:14:29,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:29,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:29,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:14:29,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:14:29,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:29,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:14:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363808847] [2025-03-03 16:14:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363808847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272029677] [2025-03-03 16:14:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:29,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:29,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:29,987 INFO L87 Difference]: Start difference. First operand 35446 states and 51057 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:14:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:31,354 INFO L93 Difference]: Finished difference Result 64644 states and 92920 transitions. [2025-03-03 16:14:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:31,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 92 [2025-03-03 16:14:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:31,423 INFO L225 Difference]: With dead ends: 64644 [2025-03-03 16:14:31,423 INFO L226 Difference]: Without dead ends: 59778 [2025-03-03 16:14:31,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:14:31,432 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 8056 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8056 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:31,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8056 Valid, 4214 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59778 states. [2025-03-03 16:14:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59778 to 40310. [2025-03-03 16:14:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40310 states, 40308 states have (on average 1.438151235486752) internal successors, (57969), 40309 states have internal predecessors, (57969), 0 states have call successors, (0), 0 states 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:14:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40310 states to 40310 states and 57969 transitions. [2025-03-03 16:14:32,499 INFO L78 Accepts]: Start accepts. Automaton has 40310 states and 57969 transitions. Word has length 92 [2025-03-03 16:14:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:32,499 INFO L471 AbstractCegarLoop]: Abstraction has 40310 states and 57969 transitions. [2025-03-03 16:14:32,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:14:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 40310 states and 57969 transitions. [2025-03-03 16:14:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:14:32,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:32,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:32,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:14:32,503 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:32,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:32,503 INFO L85 PathProgramCache]: Analyzing trace with hash 543737427, now seen corresponding path program 1 times [2025-03-03 16:14:32,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:32,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135678951] [2025-03-03 16:14:32,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:32,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:32,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:14:32,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:14:32,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:32,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:32,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:32,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135678951] [2025-03-03 16:14:32,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135678951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:32,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834417672] [2025-03-03 16:14:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:32,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:32,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:32,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:32,600 INFO L87 Difference]: Start difference. First operand 40310 states and 57969 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:33,137 INFO L93 Difference]: Finished difference Result 58554 states and 83891 transitions. [2025-03-03 16:14:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:33,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 16:14:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:33,166 INFO L225 Difference]: With dead ends: 58554 [2025-03-03 16:14:33,166 INFO L226 Difference]: Without dead ends: 22072 [2025-03-03 16:14:33,192 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:14:33,192 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 53 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 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:14:33,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22072 states. [2025-03-03 16:14:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22072 to 22070. [2025-03-03 16:14:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22070 states, 22068 states have (on average 1.4414083741163677) internal successors, (31809), 22069 states have internal predecessors, (31809), 0 states have call successors, (0), 0 states 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:14:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22070 states to 22070 states and 31809 transitions. [2025-03-03 16:14:33,960 INFO L78 Accepts]: Start accepts. Automaton has 22070 states and 31809 transitions. Word has length 93 [2025-03-03 16:14:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:33,961 INFO L471 AbstractCegarLoop]: Abstraction has 22070 states and 31809 transitions. [2025-03-03 16:14:33,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22070 states and 31809 transitions. [2025-03-03 16:14:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:14:33,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:33,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:33,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:14:33,963 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:33,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1280111130, now seen corresponding path program 1 times [2025-03-03 16:14:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:33,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034841260] [2025-03-03 16:14:33,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:33,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:33,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:14:33,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:14:33,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:33,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:34,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034841260] [2025-03-03 16:14:34,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034841260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:34,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:34,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159804458] [2025-03-03 16:14:34,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:34,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:34,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:34,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:34,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:34,035 INFO L87 Difference]: Start difference. First operand 22070 states and 31809 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:14:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:34,251 INFO L93 Difference]: Finished difference Result 31194 states and 44651 transitions. [2025-03-03 16:14:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:34,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-03 16:14:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:34,267 INFO L225 Difference]: With dead ends: 31194 [2025-03-03 16:14:34,268 INFO L226 Difference]: Without dead ends: 12952 [2025-03-03 16:14:34,280 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:14:34,284 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 50 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3133 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:14:34,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12952 states. [2025-03-03 16:14:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12952 to 12950. [2025-03-03 16:14:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12950 states, 12948 states have (on average 1.455746061167748) internal successors, (18849), 12949 states have internal predecessors, (18849), 0 states have call successors, (0), 0 states 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:14:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12950 states to 12950 states and 18849 transitions. [2025-03-03 16:14:34,507 INFO L78 Accepts]: Start accepts. Automaton has 12950 states and 18849 transitions. Word has length 95 [2025-03-03 16:14:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:34,508 INFO L471 AbstractCegarLoop]: Abstraction has 12950 states and 18849 transitions. [2025-03-03 16:14:34,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:14:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 12950 states and 18849 transitions. [2025-03-03 16:14:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 16:14:34,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:34,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:34,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:14:34,509 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:34,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2035285761, now seen corresponding path program 1 times [2025-03-03 16:14:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530240471] [2025-03-03 16:14:34,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:34,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 16:14:34,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 16:14:34,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:34,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:34,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530240471] [2025-03-03 16:14:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530240471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:34,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:34,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677831734] [2025-03-03 16:14:34,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:34,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:34,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:34,574 INFO L87 Difference]: Start difference. First operand 12950 states and 18849 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) 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:14:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:34,675 INFO L93 Difference]: Finished difference Result 17514 states and 25211 transitions. [2025-03-03 16:14:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) 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:14:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:34,686 INFO L225 Difference]: With dead ends: 17514 [2025-03-03 16:14:34,686 INFO L226 Difference]: Without dead ends: 8392 [2025-03-03 16:14:34,693 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:14:34,694 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 47 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3118 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:14:34,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8392 states. [2025-03-03 16:14:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8392 to 8390. [2025-03-03 16:14:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8390 states, 8388 states have (on average 1.4817596566523605) internal successors, (12429), 8389 states have internal predecessors, (12429), 0 states have call successors, (0), 0 states 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:14:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8390 states to 8390 states and 12429 transitions. [2025-03-03 16:14:34,832 INFO L78 Accepts]: Start accepts. Automaton has 8390 states and 12429 transitions. Word has length 97 [2025-03-03 16:14:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:34,832 INFO L471 AbstractCegarLoop]: Abstraction has 8390 states and 12429 transitions. [2025-03-03 16:14:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) 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:14:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8390 states and 12429 transitions. [2025-03-03 16:14:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:14:34,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:34,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:14:34,834 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash 238968072, now seen corresponding path program 1 times [2025-03-03 16:14:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507956987] [2025-03-03 16:14:34,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:34,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:14:34,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:14:34,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:34,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:34,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507956987] [2025-03-03 16:14:34,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507956987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:34,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:34,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:34,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629034304] [2025-03-03 16:14:34,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:34,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:34,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:34,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:34,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:34,897 INFO L87 Difference]: Start difference. First operand 8390 states and 12429 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:14:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:34,954 INFO L93 Difference]: Finished difference Result 10674 states and 15581 transitions. [2025-03-03 16:14:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:34,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-03 16:14:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:34,963 INFO L225 Difference]: With dead ends: 10674 [2025-03-03 16:14:34,963 INFO L226 Difference]: Without dead ends: 6112 [2025-03-03 16:14:34,967 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:14:34,968 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 44 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3103 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:14:34,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6112 states. [2025-03-03 16:14:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6112 to 6110. [2025-03-03 16:14:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6110 states, 6108 states have (on average 1.5142436149312377) internal successors, (9249), 6109 states have internal predecessors, (9249), 0 states have call successors, (0), 0 states 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:14:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 9249 transitions. [2025-03-03 16:14:35,056 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 9249 transitions. Word has length 99 [2025-03-03 16:14:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:35,056 INFO L471 AbstractCegarLoop]: Abstraction has 6110 states and 9249 transitions. [2025-03-03 16:14:35,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:14:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 9249 transitions. [2025-03-03 16:14:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 16:14:35,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:35,057 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, 1, 1, 1, 1] [2025-03-03 16:14:35,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:14:35,057 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1556710353, now seen corresponding path program 1 times [2025-03-03 16:14:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:35,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368721726] [2025-03-03 16:14:35,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:35,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:14:35,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:14:35,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:35,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:35,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:35,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368721726] [2025-03-03 16:14:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368721726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:35,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:35,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:35,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725892704] [2025-03-03 16:14:35,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:35,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:35,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:35,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:35,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:35,120 INFO L87 Difference]: Start difference. First operand 6110 states and 9249 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:14:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:35,168 INFO L93 Difference]: Finished difference Result 7254 states and 10811 transitions. [2025-03-03 16:14:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:35,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-03 16:14:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:35,176 INFO L225 Difference]: With dead ends: 7254 [2025-03-03 16:14:35,176 INFO L226 Difference]: Without dead ends: 4972 [2025-03-03 16:14:35,178 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:14:35,179 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3088 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:14:35,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3088 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2025-03-03 16:14:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 4970. [2025-03-03 16:14:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4970 states, 4968 states have (on average 1.5446859903381642) internal successors, (7674), 4969 states have internal predecessors, (7674), 0 states have call successors, (0), 0 states 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:14:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7674 transitions. [2025-03-03 16:14:35,239 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7674 transitions. Word has length 101 [2025-03-03 16:14:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:35,240 INFO L471 AbstractCegarLoop]: Abstraction has 4970 states and 7674 transitions. [2025-03-03 16:14:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:14:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7674 transitions. [2025-03-03 16:14:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 16:14:35,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:35,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:35,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:14:35,241 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:35,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash -928461706, now seen corresponding path program 1 times [2025-03-03 16:14:35,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:35,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107791190] [2025-03-03 16:14:35,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:35,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 16:14:35,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 16:14:35,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:35,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107791190] [2025-03-03 16:14:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107791190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011995008] [2025-03-03 16:14:35,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:35,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:35,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:35,834 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:14:35,836 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:14:35,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 16:14:35,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 16:14:35,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:35,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:35,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 16:14:35,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:36,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:36,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011995008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:36,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:36,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-03 16:14:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807749870] [2025-03-03 16:14:36,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:36,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:14:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:36,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:14:36,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:14:36,578 INFO L87 Difference]: Start difference. First operand 4970 states and 7674 transitions. Second operand has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:14:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:40,589 INFO L93 Difference]: Finished difference Result 15696 states and 22056 transitions. [2025-03-03 16:14:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-03 16:14:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 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 103 [2025-03-03 16:14:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:40,606 INFO L225 Difference]: With dead ends: 15696 [2025-03-03 16:14:40,606 INFO L226 Difference]: Without dead ends: 14456 [2025-03-03 16:14:40,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2851 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 16:14:40,612 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 16797 mSDsluCounter, 9859 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16797 SdHoareTripleChecker+Valid, 11411 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:40,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16797 Valid, 11411 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:14:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14456 states. [2025-03-03 16:14:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14456 to 13726. [2025-03-03 16:14:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13726 states, 13724 states have (on average 1.4023608277470125) internal successors, (19246), 13725 states have internal predecessors, (19246), 0 states have call successors, (0), 0 states 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:14:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13726 states to 13726 states and 19246 transitions. [2025-03-03 16:14:40,902 INFO L78 Accepts]: Start accepts. Automaton has 13726 states and 19246 transitions. Word has length 103 [2025-03-03 16:14:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:40,903 INFO L471 AbstractCegarLoop]: Abstraction has 13726 states and 19246 transitions. [2025-03-03 16:14:40,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:14:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13726 states and 19246 transitions. [2025-03-03 16:14:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:14:40,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:40,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:40,915 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:14:41,104 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,SelfDestructingSolverStorable25 [2025-03-03 16:14:41,105 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:41,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1152799269, now seen corresponding path program 1 times [2025-03-03 16:14:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695187409] [2025-03-03 16:14:41,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:41,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:14:41,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:14:41,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:41,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695187409] [2025-03-03 16:14:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695187409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32396230] [2025-03-03 16:14:41,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:41,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:41,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:41,347 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:14:41,349 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:14:41,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:14:41,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:14:41,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:41,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:41,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 16:14:41,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:42,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32396230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:42,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:42,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 32 [2025-03-03 16:14:42,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393633193] [2025-03-03 16:14:42,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:42,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 16:14:42,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:42,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 16:14:42,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:14:42,903 INFO L87 Difference]: Start difference. First operand 13726 states and 19246 transitions. Second operand has 32 states, 32 states have (on average 8.9375) internal successors, (286), 32 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:14:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:44,887 INFO L93 Difference]: Finished difference Result 34598 states and 46992 transitions. [2025-03-03 16:14:44,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 16:14:44,887 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.9375) internal successors, (286), 32 states have internal predecessors, (286), 0 states have call successors, (0), 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:14:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:44,917 INFO L225 Difference]: With dead ends: 34598 [2025-03-03 16:14:44,917 INFO L226 Difference]: Without dead ends: 24796 [2025-03-03 16:14:44,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=990, Invalid=4266, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 16:14:44,930 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 18306 mSDsluCounter, 11129 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18306 SdHoareTripleChecker+Valid, 12641 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:44,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18306 Valid, 12641 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:14:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24796 states. [2025-03-03 16:14:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24796 to 21048. [2025-03-03 16:14:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21048 states, 21046 states have (on average 1.3458139313883875) internal successors, (28324), 21047 states have internal predecessors, (28324), 0 states have call successors, (0), 0 states 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:14:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21048 states to 21048 states and 28324 transitions. [2025-03-03 16:14:45,598 INFO L78 Accepts]: Start accepts. Automaton has 21048 states and 28324 transitions. Word has length 104 [2025-03-03 16:14:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:45,598 INFO L471 AbstractCegarLoop]: Abstraction has 21048 states and 28324 transitions. [2025-03-03 16:14:45,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.9375) internal successors, (286), 32 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:14:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21048 states and 28324 transitions. [2025-03-03 16:14:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:14:45,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:45,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:45,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:14:45,800 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,SelfDestructingSolverStorable26 [2025-03-03 16:14:45,801 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1957825179, now seen corresponding path program 1 times [2025-03-03 16:14:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820868417] [2025-03-03 16:14:45,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:45,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:14:45,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:14:45,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:45,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:46,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820868417] [2025-03-03 16:14:46,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820868417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:46,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387291257] [2025-03-03 16:14:46,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:46,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:46,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:46,072 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:14:46,072 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:14:46,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:14:46,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:14:46,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:46,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:46,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:14:46,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:46,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387291257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:47,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:14:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287916870] [2025-03-03 16:14:47,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:47,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:14:47,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:47,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:14:47,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:14:47,192 INFO L87 Difference]: Start difference. First operand 21048 states and 28324 transitions. Second operand has 25 states, 25 states have (on average 11.04) internal successors, (276), 24 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:50,096 INFO L93 Difference]: Finished difference Result 91570 states and 119638 transitions. [2025-03-03 16:14:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 16:14:50,097 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.04) internal successors, (276), 24 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-03 16:14:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:50,183 INFO L225 Difference]: With dead ends: 91570 [2025-03-03 16:14:50,183 INFO L226 Difference]: Without dead ends: 74384 [2025-03-03 16:14:50,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=518, Invalid=2032, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 16:14:50,199 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 19090 mSDsluCounter, 7225 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19090 SdHoareTripleChecker+Valid, 8770 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:50,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19090 Valid, 8770 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:14:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74384 states. [2025-03-03 16:14:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74384 to 73588. [2025-03-03 16:14:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73588 states, 73586 states have (on average 1.2875411083630037) internal successors, (94745), 73587 states have internal predecessors, (94745), 0 states have call successors, (0), 0 states 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:14:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73588 states to 73588 states and 94745 transitions. [2025-03-03 16:14:52,654 INFO L78 Accepts]: Start accepts. Automaton has 73588 states and 94745 transitions. Word has length 104 [2025-03-03 16:14:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:52,655 INFO L471 AbstractCegarLoop]: Abstraction has 73588 states and 94745 transitions. [2025-03-03 16:14:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.04) internal successors, (276), 24 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 73588 states and 94745 transitions. [2025-03-03 16:14:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 16:14:52,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:52,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:52,664 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:14:52,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:52,859 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:52,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:52,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2118224261, now seen corresponding path program 1 times [2025-03-03 16:14:52,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:52,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186699103] [2025-03-03 16:14:52,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:52,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:52,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 16:14:52,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 16:14:52,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:53,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:53,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186699103] [2025-03-03 16:14:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186699103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:53,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828663798] [2025-03-03 16:14:53,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:53,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:53,942 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:14:53,943 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:14:54,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 16:14:54,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 16:14:54,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:54,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:54,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:14:54,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:54,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828663798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:55,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-03 16:14:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611374455] [2025-03-03 16:14:55,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 16:14:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:55,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 16:14:55,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-03-03 16:14:55,018 INFO L87 Difference]: Start difference. First operand 73588 states and 94745 transitions. Second operand has 28 states, 28 states have (on average 9.821428571428571) internal successors, (275), 27 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:15:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:04,907 INFO L93 Difference]: Finished difference Result 375678 states and 481288 transitions. [2025-03-03 16:15:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 16:15:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.821428571428571) internal successors, (275), 27 states have internal predecessors, (275), 0 states have call successors, (0), 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 106 [2025-03-03 16:15:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:05,296 INFO L225 Difference]: With dead ends: 375678 [2025-03-03 16:15:05,296 INFO L226 Difference]: Without dead ends: 307936 [2025-03-03 16:15:05,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=643, Invalid=2663, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 16:15:05,385 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 17522 mSDsluCounter, 5820 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17522 SdHoareTripleChecker+Valid, 7407 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:05,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17522 Valid, 7407 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:15:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307936 states. [2025-03-03 16:15:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307936 to 304980. [2025-03-03 16:15:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304980 states, 304978 states have (on average 1.2616221497944113) internal successors, (384767), 304979 states have internal predecessors, (384767), 0 states have call successors, (0), 0 states 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:15:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304980 states to 304980 states and 384767 transitions. [2025-03-03 16:15:16,645 INFO L78 Accepts]: Start accepts. Automaton has 304980 states and 384767 transitions. Word has length 106 [2025-03-03 16:15:16,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:16,645 INFO L471 AbstractCegarLoop]: Abstraction has 304980 states and 384767 transitions. [2025-03-03 16:15:16,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.821428571428571) internal successors, (275), 27 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:15:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 304980 states and 384767 transitions. [2025-03-03 16:15:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 16:15:16,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:16,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:15:16,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:15:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 16:15:16,852 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:16,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash 404254538, now seen corresponding path program 1 times [2025-03-03 16:15:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058467563] [2025-03-03 16:15:16,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:16,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 16:15:16,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 16:15:16,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:16,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058467563] [2025-03-03 16:15:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058467563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:15:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934272250] [2025-03-03 16:15:17,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:17,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:15:17,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:15:17,173 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:15:17,175 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:15:17,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 16:15:17,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 16:15:17,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:17,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:17,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:15:17,286 INFO L279 TraceCheckSpWp]: Computing forward predicates...