./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.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 724229db6d9b6e3f76c3763f8c47245763087e9314340a5d35172f234ffee2c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:24:58,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:24:58,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:24:58,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:24:58,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:24:58,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:24:58,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:24:58,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:24:58,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:24:58,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:24:58,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:24:58,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:24:58,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:24:58,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:24:58,235 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:24:58,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:24:58,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:24:58,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:24:58,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:24:58,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:24:58,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:24:58,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:24:58,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:24:58,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:24:58,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:24:58,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:24:58,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:24:58,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:24:58,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:24:58,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:24:58,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:24:58,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:24:58,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:24:58,237 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 -> 724229db6d9b6e3f76c3763f8c47245763087e9314340a5d35172f234ffee2c5 [2025-03-16 20:24:58,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:24:58,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:24:58,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:24:58,463 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:24:58,463 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:24:58,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:24:59,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a4b1147/963c9971a2e54b8ba4c4368e5cbb74d8/FLAGe4b583973 [2025-03-16 20:24:59,948 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:24:59,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:24:59,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a4b1147/963c9971a2e54b8ba4c4368e5cbb74d8/FLAGe4b583973 [2025-03-16 20:24:59,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a4b1147/963c9971a2e54b8ba4c4368e5cbb74d8 [2025-03-16 20:24:59,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:24:59,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:24:59,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:24:59,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:24:59,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:24:59,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:24:59" (1/1) ... [2025-03-16 20:24:59,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca2cc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:59, skipping insertion in model container [2025-03-16 20:24:59,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:24:59" (1/1) ... [2025-03-16 20:25:00,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:25:00,308 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.4.ufo.UNBOUNDED.pals+Problem12_label05.c[8712,8725] [2025-03-16 20:25:00,352 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.4.ufo.UNBOUNDED.pals+Problem12_label05.c[15648,15661] [2025-03-16 20:25:00,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:25:00,727 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:25:00,750 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.4.ufo.UNBOUNDED.pals+Problem12_label05.c[8712,8725] [2025-03-16 20:25:00,756 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.4.ufo.UNBOUNDED.pals+Problem12_label05.c[15648,15661] [2025-03-16 20:25:01,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:25:01,027 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:25:01,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01 WrapperNode [2025-03-16 20:25:01,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:25:01,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:25:01,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:25:01,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:25:01,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,304 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-03-16 20:25:01,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:25:01,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:25:01,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:25:01,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:25:01,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,483 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:25:01,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:25:01,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:25:01,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:25:01,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:25:01,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:25:01,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:01,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:25:01,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:25:01,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:25:01,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:25:01,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:25:01,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:25:01,811 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:25:01,813 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:25:04,969 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2025-03-16 20:25:04,969 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2025-03-16 20:25:04,969 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2025-03-16 20:25:05,149 INFO L? ?]: Removed 735 outVars from TransFormulas that were not future-live. [2025-03-16 20:25:05,149 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:25:05,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:25:05,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:25:05,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:25:05 BoogieIcfgContainer [2025-03-16 20:25:05,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:25:05,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:25:05,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:25:05,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:25:05,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:24:59" (1/3) ... [2025-03-16 20:25:05,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645288ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:25:05, skipping insertion in model container [2025-03-16 20:25:05,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (2/3) ... [2025-03-16 20:25:05,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645288ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:25:05, skipping insertion in model container [2025-03-16 20:25:05,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:25:05" (3/3) ... [2025-03-16 20:25:05,194 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:25:05,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:25:05,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 822 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:25:05,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:25:05,264 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;@161eeb46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:25:05,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:25:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:25:05,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:05,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:05,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:05,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash 640465911, now seen corresponding path program 1 times [2025-03-16 20:25:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124802231] [2025-03-16 20:25:05,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:05,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:25:05,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:25:05,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:05,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:05,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:05,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124802231] [2025-03-16 20:25:05,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124802231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:05,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:05,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:25:05,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369941424] [2025-03-16 20:25:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:05,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:25:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:05,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:25:05,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:25:05,485 INFO L87 Difference]: Start difference. First operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:05,551 INFO L93 Difference]: Finished difference Result 1617 states and 3182 transitions. [2025-03-16 20:25:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:25:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:25:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:05,571 INFO L225 Difference]: With dead ends: 1617 [2025-03-16 20:25:05,571 INFO L226 Difference]: Without dead ends: 818 [2025-03-16 20:25:05,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:25:05,580 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:05,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-16 20:25:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-03-16 20:25:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 1.8970588235294117) internal successors, (1548), 817 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1548 transitions. [2025-03-16 20:25:05,654 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1548 transitions. Word has length 19 [2025-03-16 20:25:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:05,657 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1548 transitions. [2025-03-16 20:25:05,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1548 transitions. [2025-03-16 20:25:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:25:05,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:05,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:05,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:25:05,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:05,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2146949576, now seen corresponding path program 1 times [2025-03-16 20:25:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:05,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233290511] [2025-03-16 20:25:05,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:05,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:05,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:25:05,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:25:05,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:05,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233290511] [2025-03-16 20:25:05,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233290511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:05,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:05,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:25:05,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130139053] [2025-03-16 20:25:05,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:05,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:05,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:05,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:05,836 INFO L87 Difference]: Start difference. First operand 818 states and 1548 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:05,908 INFO L93 Difference]: Finished difference Result 858 states and 1610 transitions. [2025-03-16 20:25:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:25:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:05,911 INFO L225 Difference]: With dead ends: 858 [2025-03-16 20:25:05,914 INFO L226 Difference]: Without dead ends: 818 [2025-03-16 20:25:05,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:05,915 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 0 mSDsluCounter, 3067 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:05,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4614 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-16 20:25:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-03-16 20:25:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 1.8688725490196079) internal successors, (1525), 817 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1525 transitions. [2025-03-16 20:25:05,945 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1525 transitions. Word has length 19 [2025-03-16 20:25:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:05,945 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1525 transitions. [2025-03-16 20:25:05,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1525 transitions. [2025-03-16 20:25:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:25:05,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:05,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:05,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:25:05,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:05,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1633251230, now seen corresponding path program 1 times [2025-03-16 20:25:05,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:05,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628163789] [2025-03-16 20:25:05,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:05,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:25:05,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:25:05,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:05,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:06,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:06,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628163789] [2025-03-16 20:25:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628163789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:06,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126749706] [2025-03-16 20:25:06,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:06,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:06,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:06,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:06,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:06,101 INFO L87 Difference]: Start difference. First operand 818 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:06,261 INFO L93 Difference]: Finished difference Result 1114 states and 1997 transitions. [2025-03-16 20:25:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:25:06,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 20:25:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:06,266 INFO L225 Difference]: With dead ends: 1114 [2025-03-16 20:25:06,266 INFO L226 Difference]: Without dead ends: 1077 [2025-03-16 20:25:06,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:25:06,268 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 6359 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6359 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:06,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6359 Valid, 1993 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:25:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-16 20:25:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 853. [2025-03-16 20:25:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8578143360752057) internal successors, (1581), 852 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1581 transitions. [2025-03-16 20:25:06,288 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1581 transitions. Word has length 41 [2025-03-16 20:25:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:06,289 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1581 transitions. [2025-03-16 20:25:06,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1581 transitions. [2025-03-16 20:25:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:25:06,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:06,290 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] [2025-03-16 20:25:06,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:25:06,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:06,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:06,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1854186780, now seen corresponding path program 1 times [2025-03-16 20:25:06,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:06,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687430568] [2025-03-16 20:25:06,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:06,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:06,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:25:06,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:25:06,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:06,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:06,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687430568] [2025-03-16 20:25:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687430568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374454410] [2025-03-16 20:25:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:06,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:06,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:06,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:06,536 INFO L87 Difference]: Start difference. First operand 853 states and 1581 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:06,653 INFO L93 Difference]: Finished difference Result 927 states and 1697 transitions. [2025-03-16 20:25:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:06,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:25:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:06,656 INFO L225 Difference]: With dead ends: 927 [2025-03-16 20:25:06,657 INFO L226 Difference]: Without dead ends: 855 [2025-03-16 20:25:06,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:25:06,659 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 5928 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5928 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:06,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5928 Valid, 1684 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-16 20:25:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 853. [2025-03-16 20:25:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8566392479435958) internal successors, (1580), 852 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1580 transitions. [2025-03-16 20:25:06,684 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1580 transitions. Word has length 43 [2025-03-16 20:25:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:06,684 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1580 transitions. [2025-03-16 20:25:06,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1580 transitions. [2025-03-16 20:25:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:25:06,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:06,686 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] [2025-03-16 20:25:06,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:25:06,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1855229465, now seen corresponding path program 1 times [2025-03-16 20:25:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452850114] [2025-03-16 20:25:06,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:06,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:25:06,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:25:06,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:06,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:06,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452850114] [2025-03-16 20:25:06,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452850114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:06,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:06,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876730155] [2025-03-16 20:25:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:06,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:06,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:06,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:06,781 INFO L87 Difference]: Start difference. First operand 853 states and 1580 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:06,814 INFO L93 Difference]: Finished difference Result 986 states and 1789 transitions. [2025-03-16 20:25:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:06,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:25:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:06,818 INFO L225 Difference]: With dead ends: 986 [2025-03-16 20:25:06,818 INFO L226 Difference]: Without dead ends: 914 [2025-03-16 20:25:06,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:06,820 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1573 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-16 20:25:06,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1573 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-16 20:25:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2025-03-16 20:25:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-03-16 20:25:06,844 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 43 [2025-03-16 20:25:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:06,845 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-03-16 20:25:06,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-03-16 20:25:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:25:06,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:06,846 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] [2025-03-16 20:25:06,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:25:06,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:06,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1644230272, now seen corresponding path program 1 times [2025-03-16 20:25:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:06,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159925575] [2025-03-16 20:25:06,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:25:06,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:25:06,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:06,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159925575] [2025-03-16 20:25:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159925575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:25:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966468947] [2025-03-16 20:25:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:07,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:07,026 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,059 INFO L93 Difference]: Finished difference Result 916 states and 1674 transitions. [2025-03-16 20:25:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:07,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 20:25:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,063 INFO L225 Difference]: With dead ends: 916 [2025-03-16 20:25:07,063 INFO L226 Difference]: Without dead ends: 914 [2025-03-16 20:25:07,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:07,064 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 3038 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:07,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4561 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-16 20:25:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2025-03-16 20:25:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 912 states have (on average 1.831140350877193) internal successors, (1670), 913 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1670 transitions. [2025-03-16 20:25:07,087 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1670 transitions. Word has length 44 [2025-03-16 20:25:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,088 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1670 transitions. [2025-03-16 20:25:07,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1670 transitions. [2025-03-16 20:25:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:07,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,089 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] [2025-03-16 20:25:07,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:25:07,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2138271558, now seen corresponding path program 1 times [2025-03-16 20:25:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011465651] [2025-03-16 20:25:07,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:07,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:07,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011465651] [2025-03-16 20:25:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011465651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249121974] [2025-03-16 20:25:07,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:07,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:07,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,139 INFO L87 Difference]: Start difference. First operand 914 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,165 INFO L93 Difference]: Finished difference Result 1164 states and 2050 transitions. [2025-03-16 20:25:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:07,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,169 INFO L225 Difference]: With dead ends: 1164 [2025-03-16 20:25:07,169 INFO L226 Difference]: Without dead ends: 1031 [2025-03-16 20:25:07,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,170 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 1483 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:07,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1619 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-03-16 20:25:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1029. [2025-03-16 20:25:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1027 states have (on average 1.7925998052580332) internal successors, (1841), 1028 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1841 transitions. [2025-03-16 20:25:07,193 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1841 transitions. Word has length 45 [2025-03-16 20:25:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,193 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1841 transitions. [2025-03-16 20:25:07,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1841 transitions. [2025-03-16 20:25:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:07,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,194 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] [2025-03-16 20:25:07,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:25:07,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1588482630, now seen corresponding path program 1 times [2025-03-16 20:25:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263827618] [2025-03-16 20:25:07,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:07,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:07,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263827618] [2025-03-16 20:25:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263827618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655770204] [2025-03-16 20:25:07,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,239 INFO L87 Difference]: Start difference. First operand 1029 states and 1841 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,266 INFO L93 Difference]: Finished difference Result 1493 states and 2535 transitions. [2025-03-16 20:25:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,271 INFO L225 Difference]: With dead ends: 1493 [2025-03-16 20:25:07,272 INFO L226 Difference]: Without dead ends: 1245 [2025-03-16 20:25:07,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,273 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 1481 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:07,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 1621 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-03-16 20:25:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1243. [2025-03-16 20:25:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1241 states have (on average 1.7332796132151491) internal successors, (2151), 1242 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2151 transitions. [2025-03-16 20:25:07,303 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2151 transitions. Word has length 45 [2025-03-16 20:25:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,303 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 2151 transitions. [2025-03-16 20:25:07,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2151 transitions. [2025-03-16 20:25:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:07,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,307 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] [2025-03-16 20:25:07,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:25:07,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2090513338, now seen corresponding path program 1 times [2025-03-16 20:25:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279723989] [2025-03-16 20:25:07,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:07,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:07,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279723989] [2025-03-16 20:25:07,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279723989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134951366] [2025-03-16 20:25:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:07,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,374 INFO L87 Difference]: Start difference. First operand 1243 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,406 INFO L93 Difference]: Finished difference Result 2103 states and 3409 transitions. [2025-03-16 20:25:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,411 INFO L225 Difference]: With dead ends: 2103 [2025-03-16 20:25:07,411 INFO L226 Difference]: Without dead ends: 1641 [2025-03-16 20:25:07,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,413 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1485 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:07,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-03-16 20:25:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1639. [2025-03-16 20:25:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1637 states have (on average 1.653634697617593) internal successors, (2707), 1638 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2707 transitions. [2025-03-16 20:25:07,451 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2707 transitions. Word has length 45 [2025-03-16 20:25:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,452 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2707 transitions. [2025-03-16 20:25:07,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2707 transitions. [2025-03-16 20:25:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:25:07,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,452 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] [2025-03-16 20:25:07,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:25:07,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1194131558, now seen corresponding path program 1 times [2025-03-16 20:25:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149331455] [2025-03-16 20:25:07,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:25:07,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:25:07,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149331455] [2025-03-16 20:25:07,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149331455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16544031] [2025-03-16 20:25:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:07,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,500 INFO L87 Difference]: Start difference. First operand 1639 states and 2707 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,535 INFO L93 Difference]: Finished difference Result 2542 states and 4041 transitions. [2025-03-16 20:25:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:07,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 20:25:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,542 INFO L225 Difference]: With dead ends: 2542 [2025-03-16 20:25:07,543 INFO L226 Difference]: Without dead ends: 2043 [2025-03-16 20:25:07,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,545 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 1484 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:07,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-03-16 20:25:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2025-03-16 20:25:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2039 states have (on average 1.6071603727317312) internal successors, (3277), 2040 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 3277 transitions. [2025-03-16 20:25:07,598 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 3277 transitions. Word has length 47 [2025-03-16 20:25:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,598 INFO L471 AbstractCegarLoop]: Abstraction has 2041 states and 3277 transitions. [2025-03-16 20:25:07,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 3277 transitions. [2025-03-16 20:25:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:25:07,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,600 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] [2025-03-16 20:25:07,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:25:07,600 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash 825132881, now seen corresponding path program 1 times [2025-03-16 20:25:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872052149] [2025-03-16 20:25:07,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:25:07,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:25:07,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872052149] [2025-03-16 20:25:07,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872052149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:07,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673450226] [2025-03-16 20:25:07,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:07,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:07,773 INFO L87 Difference]: Start difference. First operand 2041 states and 3277 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:12,105 INFO L93 Difference]: Finished difference Result 4296 states and 7586 transitions. [2025-03-16 20:25:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 20:25:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:12,115 INFO L225 Difference]: With dead ends: 4296 [2025-03-16 20:25:12,115 INFO L226 Difference]: Without dead ends: 3543 [2025-03-16 20:25:12,117 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-16 20:25:12,117 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 2354 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:12,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 797 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 20:25:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2025-03-16 20:25:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3543. [2025-03-16 20:25:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3541 states have (on average 1.525840158147416) internal successors, (5403), 3542 states have internal predecessors, (5403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 5403 transitions. [2025-03-16 20:25:12,201 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 5403 transitions. Word has length 59 [2025-03-16 20:25:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:12,201 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 5403 transitions. [2025-03-16 20:25:12,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 5403 transitions. [2025-03-16 20:25:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:12,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:12,203 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] [2025-03-16 20:25:12,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:25:12,203 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash 96347508, now seen corresponding path program 1 times [2025-03-16 20:25:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588150713] [2025-03-16 20:25:12,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:12,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:12,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:12,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:12,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:25:12,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:12,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588150713] [2025-03-16 20:25:12,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588150713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:12,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:12,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:12,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617570476] [2025-03-16 20:25:12,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:12,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:12,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:12,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:12,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:12,297 INFO L87 Difference]: Start difference. First operand 3543 states and 5403 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:12,418 INFO L93 Difference]: Finished difference Result 8849 states and 13016 transitions. [2025-03-16 20:25:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:12,437 INFO L225 Difference]: With dead ends: 8849 [2025-03-16 20:25:12,437 INFO L226 Difference]: Without dead ends: 7591 [2025-03-16 20:25:12,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:12,441 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 4693 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 3288 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:12,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 3288 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2025-03-16 20:25:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 4799. [2025-03-16 20:25:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4799 states, 4797 states have (on average 1.498228059203669) internal successors, (7187), 4798 states have internal predecessors, (7187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4799 states to 4799 states and 7187 transitions. [2025-03-16 20:25:12,535 INFO L78 Accepts]: Start accepts. Automaton has 4799 states and 7187 transitions. Word has length 61 [2025-03-16 20:25:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:12,536 INFO L471 AbstractCegarLoop]: Abstraction has 4799 states and 7187 transitions. [2025-03-16 20:25:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 4799 states and 7187 transitions. [2025-03-16 20:25:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:12,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:12,537 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] [2025-03-16 20:25:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:25:12,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:12,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -453441420, now seen corresponding path program 1 times [2025-03-16 20:25:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:12,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30667617] [2025-03-16 20:25:12,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:12,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:12,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:12,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:12,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:25:12,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30667617] [2025-03-16 20:25:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30667617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:12,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:12,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693002647] [2025-03-16 20:25:12,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:12,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:12,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:12,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:12,626 INFO L87 Difference]: Start difference. First operand 4799 states and 7187 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:12,757 INFO L93 Difference]: Finished difference Result 10105 states and 14800 transitions. [2025-03-16 20:25:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:12,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:12,782 INFO L225 Difference]: With dead ends: 10105 [2025-03-16 20:25:12,783 INFO L226 Difference]: Without dead ends: 8847 [2025-03-16 20:25:12,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:12,788 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4687 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:12,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4687 Valid, 3297 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8847 states. [2025-03-16 20:25:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8847 to 6687. [2025-03-16 20:25:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6687 states, 6685 states have (on average 1.4724008975317875) internal successors, (9843), 6686 states have internal predecessors, (9843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 9843 transitions. [2025-03-16 20:25:12,930 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 9843 transitions. Word has length 61 [2025-03-16 20:25:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:12,931 INFO L471 AbstractCegarLoop]: Abstraction has 6687 states and 9843 transitions. [2025-03-16 20:25:12,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 9843 transitions. [2025-03-16 20:25:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:12,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:12,932 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] [2025-03-16 20:25:12,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:25:12,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:12,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 162529908, now seen corresponding path program 1 times [2025-03-16 20:25:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046524263] [2025-03-16 20:25:12,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:12,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:12,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:12,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:12,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:12,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:25:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046524263] [2025-03-16 20:25:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046524263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473162513] [2025-03-16 20:25:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:13,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:13,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:13,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:13,020 INFO L87 Difference]: Start difference. First operand 6687 states and 9843 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:13,171 INFO L93 Difference]: Finished difference Result 11361 states and 16584 transitions. [2025-03-16 20:25:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:13,187 INFO L225 Difference]: With dead ends: 11361 [2025-03-16 20:25:13,187 INFO L226 Difference]: Without dead ends: 10103 [2025-03-16 20:25:13,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:13,192 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4651 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4651 SdHoareTripleChecker+Valid, 3354 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:13,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4651 Valid, 3354 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10103 states. [2025-03-16 20:25:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10103 to 7943. [2025-03-16 20:25:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7943 states, 7941 states have (on average 1.4641732779246945) internal successors, (11627), 7942 states have internal predecessors, (11627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 11627 transitions. [2025-03-16 20:25:13,364 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 11627 transitions. Word has length 61 [2025-03-16 20:25:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:13,364 INFO L471 AbstractCegarLoop]: Abstraction has 7943 states and 11627 transitions. [2025-03-16 20:25:13,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 11627 transitions. [2025-03-16 20:25:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:13,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:13,366 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] [2025-03-16 20:25:13,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:25:13,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:13,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1862143114, now seen corresponding path program 1 times [2025-03-16 20:25:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535397954] [2025-03-16 20:25:13,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:13,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:13,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:13,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:13,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:13,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:13,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535397954] [2025-03-16 20:25:13,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535397954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:13,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:13,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592250821] [2025-03-16 20:25:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:13,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:13,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:13,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:13,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:13,438 INFO L87 Difference]: Start difference. First operand 7943 states and 11627 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:13,497 INFO L93 Difference]: Finished difference Result 11996 states and 17479 transitions. [2025-03-16 20:25:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:13,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:25:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:13,507 INFO L225 Difference]: With dead ends: 11996 [2025-03-16 20:25:13,507 INFO L226 Difference]: Without dead ends: 6338 [2025-03-16 20:25:13,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:13,515 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 42 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:13,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3067 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2025-03-16 20:25:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6336. [2025-03-16 20:25:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6336 states, 6334 states have (on average 1.4796337227660246) internal successors, (9372), 6335 states have internal predecessors, (9372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 9372 transitions. [2025-03-16 20:25:13,604 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 9372 transitions. Word has length 63 [2025-03-16 20:25:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:13,605 INFO L471 AbstractCegarLoop]: Abstraction has 6336 states and 9372 transitions. [2025-03-16 20:25:13,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 9372 transitions. [2025-03-16 20:25:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:13,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:13,606 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] [2025-03-16 20:25:13,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:25:13,606 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1705173780, now seen corresponding path program 1 times [2025-03-16 20:25:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016692750] [2025-03-16 20:25:13,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:13,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:13,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:13,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:13,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:25:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016692750] [2025-03-16 20:25:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016692750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:13,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537365935] [2025-03-16 20:25:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:13,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:13,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:13,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:13,693 INFO L87 Difference]: Start difference. First operand 6336 states and 9372 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:13,825 INFO L93 Difference]: Finished difference Result 9930 states and 14561 transitions. [2025-03-16 20:25:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:25:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:13,838 INFO L225 Difference]: With dead ends: 9930 [2025-03-16 20:25:13,838 INFO L226 Difference]: Without dead ends: 9032 [2025-03-16 20:25:13,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:13,842 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 4655 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:13,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 3322 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2025-03-16 20:25:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 7232. [2025-03-16 20:25:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 7230 states have (on average 1.4733056708160444) internal successors, (10652), 7231 states have internal predecessors, (10652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 10652 transitions. [2025-03-16 20:25:13,952 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 10652 transitions. Word has length 63 [2025-03-16 20:25:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:13,952 INFO L471 AbstractCegarLoop]: Abstraction has 7232 states and 10652 transitions. [2025-03-16 20:25:13,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 10652 transitions. [2025-03-16 20:25:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:25:13,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:13,953 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] [2025-03-16 20:25:13,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:25:13,953 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:13,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1410201656, now seen corresponding path program 1 times [2025-03-16 20:25:13,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:13,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928725323] [2025-03-16 20:25:13,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:13,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:13,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:25:13,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:25:13,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:13,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:14,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:14,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928725323] [2025-03-16 20:25:14,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928725323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:14,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:14,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872521857] [2025-03-16 20:25:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:14,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:14,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:14,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:14,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:14,042 INFO L87 Difference]: Start difference. First operand 7232 states and 10652 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:14,086 INFO L93 Difference]: Finished difference Result 9700 states and 14174 transitions. [2025-03-16 20:25:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:25:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:14,093 INFO L225 Difference]: With dead ends: 9700 [2025-03-16 20:25:14,093 INFO L226 Difference]: Without dead ends: 4770 [2025-03-16 20:25:14,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:14,098 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 37 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:14,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3052 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2025-03-16 20:25:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 4768. [2025-03-16 20:25:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4768 states, 4766 states have (on average 1.4872010071338648) internal successors, (7088), 4767 states have internal predecessors, (7088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 7088 transitions. [2025-03-16 20:25:14,154 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 7088 transitions. Word has length 64 [2025-03-16 20:25:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:14,155 INFO L471 AbstractCegarLoop]: Abstraction has 4768 states and 7088 transitions. [2025-03-16 20:25:14,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 7088 transitions. [2025-03-16 20:25:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:25:14,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:14,156 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] [2025-03-16 20:25:14,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:25:14,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:14,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2134590337, now seen corresponding path program 1 times [2025-03-16 20:25:14,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:14,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866238758] [2025-03-16 20:25:14,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:14,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:14,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:25:14,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:25:14,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:14,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:14,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866238758] [2025-03-16 20:25:14,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866238758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:14,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:14,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268662863] [2025-03-16 20:25:14,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:14,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:14,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:14,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:14,222 INFO L87 Difference]: Start difference. First operand 4768 states and 7088 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:14,251 INFO L93 Difference]: Finished difference Result 6004 states and 8828 transitions. [2025-03-16 20:25:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 20:25:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:14,256 INFO L225 Difference]: With dead ends: 6004 [2025-03-16 20:25:14,256 INFO L226 Difference]: Without dead ends: 3538 [2025-03-16 20:25:14,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:14,259 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 34 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:14,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3037 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2025-03-16 20:25:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3536. [2025-03-16 20:25:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 3534 states have (on average 1.5076400679117148) internal successors, (5328), 3535 states have internal predecessors, (5328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 5328 transitions. [2025-03-16 20:25:14,296 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 5328 transitions. Word has length 66 [2025-03-16 20:25:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:14,296 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 5328 transitions. [2025-03-16 20:25:14,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 5328 transitions. [2025-03-16 20:25:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:25:14,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:14,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:14,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:25:14,297 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:14,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1210827322, now seen corresponding path program 1 times [2025-03-16 20:25:14,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:14,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493881620] [2025-03-16 20:25:14,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:14,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:25:14,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:25:14,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:14,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:14,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493881620] [2025-03-16 20:25:14,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493881620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:14,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:14,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:14,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260607310] [2025-03-16 20:25:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:14,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:14,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:14,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:14,353 INFO L87 Difference]: Start difference. First operand 3536 states and 5328 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-16 20:25:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:14,375 INFO L93 Difference]: Finished difference Result 4156 states and 6188 transitions. [2025-03-16 20:25:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-16 20:25:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:14,379 INFO L225 Difference]: With dead ends: 4156 [2025-03-16 20:25:14,379 INFO L226 Difference]: Without dead ends: 2922 [2025-03-16 20:25:14,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:14,381 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 31 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:14,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-16 20:25:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2920. [2025-03-16 20:25:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2918 states have (on average 1.5281014393420151) internal successors, (4459), 2919 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4459 transitions. [2025-03-16 20:25:14,410 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4459 transitions. Word has length 68 [2025-03-16 20:25:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4459 transitions. [2025-03-16 20:25:14,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-16 20:25:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4459 transitions. [2025-03-16 20:25:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:25:14,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:14,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:14,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:25:14,411 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:14,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash 301011955, now seen corresponding path program 1 times [2025-03-16 20:25:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:14,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014923647] [2025-03-16 20:25:14,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:14,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:14,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:14,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:14,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:14,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:15,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:15,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014923647] [2025-03-16 20:25:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014923647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:15,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449317752] [2025-03-16 20:25:15,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:15,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:15,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:15,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:25:15,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:25:15,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:15,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:15,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:15,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:15,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:25:15,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:15,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449317752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:16,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:16,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-16 20:25:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101192320] [2025-03-16 20:25:16,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:16,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:25:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:16,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:25:16,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:25:16,625 INFO L87 Difference]: Start difference. First operand 2920 states and 4459 transitions. Second operand has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:19,050 INFO L93 Difference]: Finished difference Result 6014 states and 8712 transitions. [2025-03-16 20:25:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 20:25:19,050 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 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 70 [2025-03-16 20:25:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:19,058 INFO L225 Difference]: With dead ends: 6014 [2025-03-16 20:25:19,058 INFO L226 Difference]: Without dead ends: 5396 [2025-03-16 20:25:19,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=999, Invalid=4257, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 20:25:19,061 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 23522 mSDsluCounter, 6468 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23522 SdHoareTripleChecker+Valid, 7965 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:19,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23522 Valid, 7965 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:25:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2025-03-16 20:25:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5296. [2025-03-16 20:25:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5296 states, 5294 states have (on average 1.4406875708349074) internal successors, (7627), 5295 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 7627 transitions. [2025-03-16 20:25:19,129 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 7627 transitions. Word has length 70 [2025-03-16 20:25:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:19,129 INFO L471 AbstractCegarLoop]: Abstraction has 5296 states and 7627 transitions. [2025-03-16 20:25:19,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 7627 transitions. [2025-03-16 20:25:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:25:19,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:19,130 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:19,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:25:19,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:19,334 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:19,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1576910278, now seen corresponding path program 1 times [2025-03-16 20:25:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836658738] [2025-03-16 20:25:19,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:19,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:19,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:19,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:19,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:19,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836658738] [2025-03-16 20:25:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836658738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426773781] [2025-03-16 20:25:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:19,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:19,642 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-16 20:25:19,643 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-16 20:25:19,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:19,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:19,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:19,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:19,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:25:19,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:20,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:22,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426773781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:22,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:22,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 18] total 41 [2025-03-16 20:25:22,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926614645] [2025-03-16 20:25:22,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:22,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-16 20:25:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:22,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-16 20:25:22,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 20:25:22,830 INFO L87 Difference]: Start difference. First operand 5296 states and 7627 transitions. Second operand has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:00,236 INFO L93 Difference]: Finished difference Result 26624 states and 36154 transitions. [2025-03-16 20:26:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2025-03-16 20:26:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 20:26:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:00,303 INFO L225 Difference]: With dead ends: 26624 [2025-03-16 20:26:00,303 INFO L226 Difference]: Without dead ends: 23630 [2025-03-16 20:26:00,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29850 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=10208, Invalid=59752, Unknown=0, NotChecked=0, Total=69960 [2025-03-16 20:26:00,317 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 24582 mSDsluCounter, 19803 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24582 SdHoareTripleChecker+Valid, 21356 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:00,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24582 Valid, 21356 Invalid, 3196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 20:26:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23630 states. [2025-03-16 20:26:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23630 to 8436. [2025-03-16 20:26:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8436 states, 8434 states have (on average 1.3942376096751246) internal successors, (11759), 8435 states have internal predecessors, (11759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 11759 transitions. [2025-03-16 20:26:00,607 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 11759 transitions. Word has length 71 [2025-03-16 20:26:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:26:00,607 INFO L471 AbstractCegarLoop]: Abstraction has 8436 states and 11759 transitions. [2025-03-16 20:26:00,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 11759 transitions. [2025-03-16 20:26:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:26:00,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:26:00,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:26:00,617 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-16 20:26:00,810 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,SelfDestructingSolverStorable20 [2025-03-16 20:26:00,813 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:26:00,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:26:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -416617920, now seen corresponding path program 1 times [2025-03-16 20:26:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:26:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700343572] [2025-03-16 20:26:00,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:26:00,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:26:00,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:26:00,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:00,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700343572] [2025-03-16 20:26:02,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700343572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905534890] [2025-03-16 20:26:02,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:02,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:02,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:02,199 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-16 20:26:02,200 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-16 20:26:02,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:26:02,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:26:02,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:02,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:02,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:26:02,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:02,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:04,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905534890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:04,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:04,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 16] total 51 [2025-03-16 20:26:04,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228044023] [2025-03-16 20:26:04,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:04,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-16 20:26:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:04,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-16 20:26:04,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 20:26:04,102 INFO L87 Difference]: Start difference. First operand 8436 states and 11759 transitions. Second operand has 51 states, 51 states have (on average 4.03921568627451) internal successors, (206), 51 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)