./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.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.6.1.ufo.BOUNDED-12.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 87305a5a64643923e8c67b443e2c0728b204b4b8052ef3905bef24700762109e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:29:47,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:29:47,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:29:47,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:29:47,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:29:47,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:29:47,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:29:47,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:29:47,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:29:47,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:29:47,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:29:47,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:29:47,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:29:47,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:29:47,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:29:47,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:29:47,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:29:47,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:29:47,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:29:47,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:29:47,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:29:47,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:29:47,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:29:47,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:29:47,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:29:47,739 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:29:47,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:29:47,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:29:47,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:29:47,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:29:47,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:29:47,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:29:47,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:29:47,740 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 -> 87305a5a64643923e8c67b443e2c0728b204b4b8052ef3905bef24700762109e [2025-03-16 20:29:47,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:29:47,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:29:47,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:29:47,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:29:47,978 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:29:47,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c [2025-03-16 20:29:49,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d412917/120c4e6322884f478b5c941de2e6795e/FLAGf29637d15 [2025-03-16 20:29:49,556 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:29:49,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c [2025-03-16 20:29:49,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d412917/120c4e6322884f478b5c941de2e6795e/FLAGf29637d15 [2025-03-16 20:29:49,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d412917/120c4e6322884f478b5c941de2e6795e [2025-03-16 20:29:49,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:29:49,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:29:49,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:29:49,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:29:49,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:29:49,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:29:49" (1/1) ... [2025-03-16 20:29:49,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7b2022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:49, skipping insertion in model container [2025-03-16 20:29:49,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:29:49" (1/1) ... [2025-03-16 20:29:49,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:29:50,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c[15519,15532] [2025-03-16 20:29:50,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c[22455,22468] [2025-03-16 20:29:50,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:29:50,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:29:50,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c[15519,15532] [2025-03-16 20:29:50,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c[22455,22468] [2025-03-16 20:29:50,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:29:51,012 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:29:51,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51 WrapperNode [2025-03-16 20:29:51,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:29:51,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:29:51,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:29:51,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:29:51,020 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:29:51" (1/1) ... [2025-03-16 20:29:51,065 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:29:51" (1/1) ... [2025-03-16 20:29:51,360 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5154 [2025-03-16 20:29:51,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:29:51,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:29:51,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:29:51,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:29:51,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,561 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:29:51,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:29:51,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:29:51,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:29:51,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:29:51,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (1/1) ... [2025-03-16 20:29:51,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:29:51,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:51,788 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:29:51,793 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:29:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:29:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:29:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:29:51,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:29:51,897 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:29:51,899 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:29:55,587 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3685: havoc calculate_output2_#t~ret43#1; [2025-03-16 20:29:55,588 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5175: havoc calculate_output3_#t~ret44#1; [2025-03-16 20:29:55,588 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc calculate_output_#t~ret42#1; [2025-03-16 20:29:55,707 INFO L? ?]: Removed 746 outVars from TransFormulas that were not future-live. [2025-03-16 20:29:55,707 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:29:55,735 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:29:55,737 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:29:55,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:29:55 BoogieIcfgContainer [2025-03-16 20:29:55,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:29:55,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:29:55,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:29:55,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:29:55,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:29:49" (1/3) ... [2025-03-16 20:29:55,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f2140d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:29:55, skipping insertion in model container [2025-03-16 20:29:55,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:51" (2/3) ... [2025-03-16 20:29:55,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f2140d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:29:55, skipping insertion in model container [2025-03-16 20:29:55,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:29:55" (3/3) ... [2025-03-16 20:29:55,748 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c [2025-03-16 20:29:55,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:29:55,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c that has 1 procedures, 849 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:29:55,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:29:55,827 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;@c637465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:29:55,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:29:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 849 states, 846 states have (on average 1.9716312056737588) internal successors, (1668), 848 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states 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:29:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:29:55,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:55,836 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] [2025-03-16 20:29:55,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:55,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1545405242, now seen corresponding path program 1 times [2025-03-16 20:29:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:55,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443178060] [2025-03-16 20:29:55,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:55,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:29:55,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:29:55,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:55,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:56,086 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:29:56,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:56,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443178060] [2025-03-16 20:29:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443178060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:56,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:29:56,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55178708] [2025-03-16 20:29:56,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:29:56,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:56,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:29:56,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:29:56,135 INFO L87 Difference]: Start difference. First operand has 849 states, 846 states have (on average 1.9716312056737588) internal successors, (1668), 848 states have internal predecessors, (1668), 0 states have call successors, (0), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:29:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:56,250 INFO L93 Difference]: Finished difference Result 1654 states and 3250 transitions. [2025-03-16 20:29:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:29:56,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:29:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:56,265 INFO L225 Difference]: With dead ends: 1654 [2025-03-16 20:29:56,265 INFO L226 Difference]: Without dead ends: 845 [2025-03-16 20:29:56,269 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:29:56,271 INFO L435 NwaCegarLoop]: 1604 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, 1604 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:29:56,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-16 20:29:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2025-03-16 20:29:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.896797153024911) internal successors, (1599), 844 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states 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:29:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1599 transitions. [2025-03-16 20:29:56,362 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1599 transitions. Word has length 23 [2025-03-16 20:29:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:56,362 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1599 transitions. [2025-03-16 20:29:56,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:29:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1599 transitions. [2025-03-16 20:29:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:29:56,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:56,363 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] [2025-03-16 20:29:56,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:29:56,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 700933371, now seen corresponding path program 1 times [2025-03-16 20:29:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060638149] [2025-03-16 20:29:56,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:56,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:29:56,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:29:56,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:56,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:56,609 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:29:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060638149] [2025-03-16 20:29:56,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060638149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:56,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:56,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:29:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053647289] [2025-03-16 20:29:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:56,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:29:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:56,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:29:56,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:29:56,611 INFO L87 Difference]: Start difference. First operand 845 states and 1599 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:29:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:56,698 INFO L93 Difference]: Finished difference Result 895 states and 1678 transitions. [2025-03-16 20:29:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:29:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:29:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:56,703 INFO L225 Difference]: With dead ends: 895 [2025-03-16 20:29:56,703 INFO L226 Difference]: Without dead ends: 845 [2025-03-16 20:29:56,704 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:29:56,705 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 0 mSDsluCounter, 3152 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:56,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4750 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-16 20:29:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2025-03-16 20:29:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.849347568208778) internal successors, (1559), 844 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states 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:29:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1559 transitions. [2025-03-16 20:29:56,723 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1559 transitions. Word has length 23 [2025-03-16 20:29:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:56,723 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1559 transitions. [2025-03-16 20:29:56,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:29:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1559 transitions. [2025-03-16 20:29:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:29:56,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:56,727 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:29:56,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:29:56,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:56,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:56,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2009793884, now seen corresponding path program 1 times [2025-03-16 20:29:56,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:56,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302296732] [2025-03-16 20:29:56,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:56,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:29:56,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:29:56,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:56,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:56,952 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:29:56,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302296732] [2025-03-16 20:29:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302296732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:56,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:56,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494859341] [2025-03-16 20:29:56,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:56,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:29:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:56,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:29:56,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:29:56,955 INFO L87 Difference]: Start difference. First operand 845 states and 1559 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:30:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:01,892 INFO L93 Difference]: Finished difference Result 3100 states and 5868 transitions. [2025-03-16 20:30:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:30:01,893 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:30:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:01,902 INFO L225 Difference]: With dead ends: 3100 [2025-03-16 20:30:01,902 INFO L226 Difference]: Without dead ends: 2347 [2025-03-16 20:30:01,905 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:30:01,906 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 2422 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2422 SdHoareTripleChecker+Valid, 831 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.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:01,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2422 Valid, 831 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 20:30:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2025-03-16 20:30:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2347. [2025-03-16 20:30:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 2345 states have (on average 1.5714285714285714) internal successors, (3685), 2346 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states 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:30:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3685 transitions. [2025-03-16 20:30:01,954 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3685 transitions. Word has length 59 [2025-03-16 20:30:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:01,955 INFO L471 AbstractCegarLoop]: Abstraction has 2347 states and 3685 transitions. [2025-03-16 20:30:01,955 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:30:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3685 transitions. [2025-03-16 20:30:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:30:01,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:01,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:01,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:30:01,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:01,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1828731592, now seen corresponding path program 1 times [2025-03-16 20:30:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:01,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431123206] [2025-03-16 20:30:01,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:01,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:30:01,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:30:01,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:01,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:02,198 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:30:02,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:02,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431123206] [2025-03-16 20:30:02,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431123206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:02,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:02,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:02,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32237936] [2025-03-16 20:30:02,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:02,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:02,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:02,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:02,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:02,200 INFO L87 Difference]: Start difference. First operand 2347 states and 3685 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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:30:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:02,511 INFO L93 Difference]: Finished difference Result 2911 states and 4597 transitions. [2025-03-16 20:30:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:30:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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 62 [2025-03-16 20:30:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:02,521 INFO L225 Difference]: With dead ends: 2911 [2025-03-16 20:30:02,521 INFO L226 Difference]: Without dead ends: 2864 [2025-03-16 20:30:02,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:30:02,525 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 9674 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9674 SdHoareTripleChecker+Valid, 3778 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:02,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9674 Valid, 3778 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2025-03-16 20:30:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2392. [2025-03-16 20:30:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2390 states have (on average 1.5723849372384937) internal successors, (3758), 2391 states have internal predecessors, (3758), 0 states have call successors, (0), 0 states 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:30:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3758 transitions. [2025-03-16 20:30:02,578 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3758 transitions. Word has length 62 [2025-03-16 20:30:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:02,579 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3758 transitions. [2025-03-16 20:30:02,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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:30:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3758 transitions. [2025-03-16 20:30:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:30:02,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:02,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:02,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:30:02,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:02,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash -732253638, now seen corresponding path program 1 times [2025-03-16 20:30:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756176151] [2025-03-16 20:30:02,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:02,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:30:02,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:30:02,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:02,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:02,867 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:30:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756176151] [2025-03-16 20:30:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756176151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:02,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:02,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171455457] [2025-03-16 20:30:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:02,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:02,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:02,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:02,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:02,868 INFO L87 Difference]: Start difference. First operand 2392 states and 3758 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:30:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:03,043 INFO L93 Difference]: Finished difference Result 2486 states and 3908 transitions. [2025-03-16 20:30:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:03,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:30:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:03,050 INFO L225 Difference]: With dead ends: 2486 [2025-03-16 20:30:03,050 INFO L226 Difference]: Without dead ends: 2394 [2025-03-16 20:30:03,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:30:03,053 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 7490 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7490 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:03,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7490 Valid, 1914 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2025-03-16 20:30:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2392. [2025-03-16 20:30:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2390 states have (on average 1.5719665271966528) internal successors, (3757), 2391 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states 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:30:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3757 transitions. [2025-03-16 20:30:03,087 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3757 transitions. Word has length 64 [2025-03-16 20:30:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3757 transitions. [2025-03-16 20:30:03,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:30:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3757 transitions. [2025-03-16 20:30:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:30:03,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:03,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:30:03,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash -733296323, now seen corresponding path program 1 times [2025-03-16 20:30:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397778907] [2025-03-16 20:30:03,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:03,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:30:03,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:30:03,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:03,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:03,199 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:30:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397778907] [2025-03-16 20:30:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397778907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:03,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382266479] [2025-03-16 20:30:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:03,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:03,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:03,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:03,200 INFO L87 Difference]: Start difference. First operand 2392 states and 3757 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:30:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:03,228 INFO L93 Difference]: Finished difference Result 2565 states and 4034 transitions. [2025-03-16 20:30:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:03,228 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:30:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:03,237 INFO L225 Difference]: With dead ends: 2565 [2025-03-16 20:30:03,237 INFO L226 Difference]: Without dead ends: 2473 [2025-03-16 20:30:03,239 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:30:03,239 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 1488 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:03,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1629 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2025-03-16 20:30:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2471. [2025-03-16 20:30:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2469 states have (on average 1.5722964763061968) internal successors, (3882), 2470 states have internal predecessors, (3882), 0 states have call successors, (0), 0 states 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:30:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3882 transitions. [2025-03-16 20:30:03,279 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3882 transitions. Word has length 64 [2025-03-16 20:30:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:03,279 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3882 transitions. [2025-03-16 20:30:03,280 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:30:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3882 transitions. [2025-03-16 20:30:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 20:30:03,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:03,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:03,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:30:03,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1224041238, now seen corresponding path program 1 times [2025-03-16 20:30:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588053613] [2025-03-16 20:30:03,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:03,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 20:30:03,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 20:30:03,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:03,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:03,500 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:30:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588053613] [2025-03-16 20:30:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588053613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:03,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:30:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691052088] [2025-03-16 20:30:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:03,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:30:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:03,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:30:03,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:30:03,502 INFO L87 Difference]: Start difference. First operand 2471 states and 3882 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:03,535 INFO L93 Difference]: Finished difference Result 2477 states and 3889 transitions. [2025-03-16 20:30:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:30:03,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 20:30:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:03,543 INFO L225 Difference]: With dead ends: 2477 [2025-03-16 20:30:03,543 INFO L226 Difference]: Without dead ends: 2475 [2025-03-16 20:30:03,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:30:03,544 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 6209 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7764 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:03,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7764 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2025-03-16 20:30:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2025-03-16 20:30:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2473 states have (on average 1.570966437525273) internal successors, (3885), 2474 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states 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:30:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3885 transitions. [2025-03-16 20:30:03,579 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3885 transitions. Word has length 65 [2025-03-16 20:30:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:03,579 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3885 transitions. [2025-03-16 20:30:03,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3885 transitions. [2025-03-16 20:30:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:03,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:03,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:03,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:30:03,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:03,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1959673116, now seen corresponding path program 1 times [2025-03-16 20:30:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99958823] [2025-03-16 20:30:03,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:03,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:03,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:03,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:03,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:03,634 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:30:03,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99958823] [2025-03-16 20:30:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99958823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:03,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:03,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680281746] [2025-03-16 20:30:03,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:03,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:03,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:03,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:03,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:03,635 INFO L87 Difference]: Start difference. First operand 2475 states and 3885 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:30:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:03,660 INFO L93 Difference]: Finished difference Result 2661 states and 4178 transitions. [2025-03-16 20:30:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:03,660 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:30:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:03,667 INFO L225 Difference]: With dead ends: 2661 [2025-03-16 20:30:03,668 INFO L226 Difference]: Without dead ends: 2565 [2025-03-16 20:30:03,669 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:30:03,669 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1504 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1697 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:30:03,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1697 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2025-03-16 20:30:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2563. [2025-03-16 20:30:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2561 states have (on average 1.5704802811401797) internal successors, (4022), 2562 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states 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:30:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4022 transitions. [2025-03-16 20:30:03,707 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4022 transitions. Word has length 66 [2025-03-16 20:30:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:03,709 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 4022 transitions. [2025-03-16 20:30:03,709 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:30:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4022 transitions. [2025-03-16 20:30:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:03,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:03,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:03,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:30:03,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 678830108, now seen corresponding path program 1 times [2025-03-16 20:30:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265159303] [2025-03-16 20:30:03,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:03,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:03,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:03,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:03,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:03,793 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:30:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:03,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265159303] [2025-03-16 20:30:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265159303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:03,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074231220] [2025-03-16 20:30:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:03,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:03,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:03,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:03,795 INFO L87 Difference]: Start difference. First operand 2563 states and 4022 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:30:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:03,825 INFO L93 Difference]: Finished difference Result 3061 states and 4802 transitions. [2025-03-16 20:30:03,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:03,825 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:30:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:03,834 INFO L225 Difference]: With dead ends: 3061 [2025-03-16 20:30:03,834 INFO L226 Difference]: Without dead ends: 2800 [2025-03-16 20:30:03,835 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:30:03,836 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1502 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1703 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:30:03,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2025-03-16 20:30:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2798. [2025-03-16 20:30:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2796 states have (on average 1.5679542203147354) internal successors, (4384), 2797 states have internal predecessors, (4384), 0 states have call successors, (0), 0 states 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:30:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4384 transitions. [2025-03-16 20:30:03,893 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4384 transitions. Word has length 66 [2025-03-16 20:30:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:03,893 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4384 transitions. [2025-03-16 20:30:03,893 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:30:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4384 transitions. [2025-03-16 20:30:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:03,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:03,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:03,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:30:03,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:03,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1522189084, now seen corresponding path program 1 times [2025-03-16 20:30:03,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:03,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200155504] [2025-03-16 20:30:03,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:03,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:03,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:03,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:03,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:03,950 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:30:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200155504] [2025-03-16 20:30:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200155504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:03,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916377985] [2025-03-16 20:30:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:03,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:03,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:03,952 INFO L87 Difference]: Start difference. First operand 2798 states and 4384 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:30:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:03,989 INFO L93 Difference]: Finished difference Result 3742 states and 5846 transitions. [2025-03-16 20:30:03,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:03,990 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:30:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:04,000 INFO L225 Difference]: With dead ends: 3742 [2025-03-16 20:30:04,000 INFO L226 Difference]: Without dead ends: 3246 [2025-03-16 20:30:04,002 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:30:04,002 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1500 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1705 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:30:04,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1705 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2025-03-16 20:30:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3244. [2025-03-16 20:30:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 3242 states have (on average 1.5607649599012956) internal successors, (5060), 3243 states have internal predecessors, (5060), 0 states have call successors, (0), 0 states 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:30:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 5060 transitions. [2025-03-16 20:30:04,061 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 5060 transitions. Word has length 66 [2025-03-16 20:30:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:04,062 INFO L471 AbstractCegarLoop]: Abstraction has 3244 states and 5060 transitions. [2025-03-16 20:30:04,062 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:30:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 5060 transitions. [2025-03-16 20:30:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:04,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:04,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:04,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:30:04,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:04,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2015737572, now seen corresponding path program 1 times [2025-03-16 20:30:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:04,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86212104] [2025-03-16 20:30:04,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:04,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:04,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:04,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:04,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:04,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:04,106 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:30:04,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:04,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86212104] [2025-03-16 20:30:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86212104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:04,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:04,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722246848] [2025-03-16 20:30:04,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:04,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:04,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:04,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:04,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:04,108 INFO L87 Difference]: Start difference. First operand 3244 states and 5060 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:30:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:04,145 INFO L93 Difference]: Finished difference Result 5032 states and 7790 transitions. [2025-03-16 20:30:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:04,145 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:30:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:04,156 INFO L225 Difference]: With dead ends: 5032 [2025-03-16 20:30:04,156 INFO L226 Difference]: Without dead ends: 4090 [2025-03-16 20:30:04,158 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:30:04,158 INFO L435 NwaCegarLoop]: 1608 mSDtfsCounter, 1496 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1701 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:30:04,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1701 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2025-03-16 20:30:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 4088. [2025-03-16 20:30:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4086 states have (on average 1.5457660303475282) internal successors, (6316), 4087 states have internal predecessors, (6316), 0 states have call successors, (0), 0 states 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:30:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 6316 transitions. [2025-03-16 20:30:04,221 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 6316 transitions. Word has length 66 [2025-03-16 20:30:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:04,221 INFO L471 AbstractCegarLoop]: Abstraction has 4088 states and 6316 transitions. [2025-03-16 20:30:04,221 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:30:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 6316 transitions. [2025-03-16 20:30:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:04,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:04,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:04,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:30:04,222 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1729440796, now seen corresponding path program 1 times [2025-03-16 20:30:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:04,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89231259] [2025-03-16 20:30:04,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:04,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:04,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:04,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:04,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:04,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:04,261 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:30:04,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:04,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89231259] [2025-03-16 20:30:04,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89231259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:04,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:04,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322339381] [2025-03-16 20:30:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:04,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:04,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:04,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:04,263 INFO L87 Difference]: Start difference. First operand 4088 states and 6316 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:30:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:04,314 INFO L93 Difference]: Finished difference Result 7468 states and 11390 transitions. [2025-03-16 20:30:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:04,315 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:30:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:04,329 INFO L225 Difference]: With dead ends: 7468 [2025-03-16 20:30:04,329 INFO L226 Difference]: Without dead ends: 5682 [2025-03-16 20:30:04,337 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:30:04,338 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 1494 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1703 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:30:04,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5682 states. [2025-03-16 20:30:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5682 to 5680. [2025-03-16 20:30:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5678 states have (on average 1.5209580838323353) internal successors, (8636), 5679 states have internal predecessors, (8636), 0 states have call successors, (0), 0 states 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:30:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 8636 transitions. [2025-03-16 20:30:04,506 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 8636 transitions. Word has length 66 [2025-03-16 20:30:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:04,506 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 8636 transitions. [2025-03-16 20:30:04,507 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:30:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 8636 transitions. [2025-03-16 20:30:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:04,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:04,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:04,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:30:04,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:04,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1949555172, now seen corresponding path program 1 times [2025-03-16 20:30:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445519602] [2025-03-16 20:30:04,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:04,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:04,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:04,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:04,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:04,623 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:30:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445519602] [2025-03-16 20:30:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445519602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:04,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409438306] [2025-03-16 20:30:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:04,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:04,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:04,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:04,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:04,624 INFO L87 Difference]: Start difference. First operand 5680 states and 8636 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:30:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:04,732 INFO L93 Difference]: Finished difference Result 12052 states and 18014 transitions. [2025-03-16 20:30:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:04,733 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:30:04,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:04,746 INFO L225 Difference]: With dead ends: 12052 [2025-03-16 20:30:04,746 INFO L226 Difference]: Without dead ends: 8674 [2025-03-16 20:30:04,751 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:30:04,751 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1498 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:04,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8674 states. [2025-03-16 20:30:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8674 to 8672. [2025-03-16 20:30:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8672 states, 8670 states have (on average 1.486966551326413) internal successors, (12892), 8671 states have internal predecessors, (12892), 0 states have call successors, (0), 0 states 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:30:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8672 states to 8672 states and 12892 transitions. [2025-03-16 20:30:04,971 INFO L78 Accepts]: Start accepts. Automaton has 8672 states and 12892 transitions. Word has length 66 [2025-03-16 20:30:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:04,971 INFO L471 AbstractCegarLoop]: Abstraction has 8672 states and 12892 transitions. [2025-03-16 20:30:04,971 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:30:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8672 states and 12892 transitions. [2025-03-16 20:30:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:04,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:04,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:04,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:30:04,974 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash 264641035, now seen corresponding path program 1 times [2025-03-16 20:30:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856185374] [2025-03-16 20:30:04,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:04,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:04,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:04,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:04,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:30:05,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:05,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856185374] [2025-03-16 20:30:05,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856185374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:05,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:05,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536917521] [2025-03-16 20:30:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:05,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:05,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:05,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:05,129 INFO L87 Difference]: Start difference. First operand 8672 states and 12892 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:05,816 INFO L93 Difference]: Finished difference Result 46318 states and 67715 transitions. [2025-03-16 20:30:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:30:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:05,962 INFO L225 Difference]: With dead ends: 46318 [2025-03-16 20:30:05,962 INFO L226 Difference]: Without dead ends: 41836 [2025-03-16 20:30:05,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:05,978 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 8065 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8065 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:05,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8065 Valid, 4056 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:06,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41836 states. [2025-03-16 20:30:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41836 to 14112. [2025-03-16 20:30:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14112 states, 14110 states have (on average 1.4693125442948263) internal successors, (20732), 14111 states have internal predecessors, (20732), 0 states have call successors, (0), 0 states 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:30:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14112 states to 14112 states and 20732 transitions. [2025-03-16 20:30:06,464 INFO L78 Accepts]: Start accepts. Automaton has 14112 states and 20732 transitions. Word has length 86 [2025-03-16 20:30:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:06,464 INFO L471 AbstractCegarLoop]: Abstraction has 14112 states and 20732 transitions. [2025-03-16 20:30:06,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 14112 states and 20732 transitions. [2025-03-16 20:30:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:06,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:06,468 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:06,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:30:06,469 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:06,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1016201973, now seen corresponding path program 1 times [2025-03-16 20:30:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:06,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517762601] [2025-03-16 20:30:06,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:06,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:06,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:06,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:06,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:30:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517762601] [2025-03-16 20:30:06,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517762601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:06,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:06,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132218797] [2025-03-16 20:30:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:06,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:06,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:06,645 INFO L87 Difference]: Start difference. First operand 14112 states and 20732 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:07,697 INFO L93 Difference]: Finished difference Result 52686 states and 76931 transitions. [2025-03-16 20:30:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:30:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:07,762 INFO L225 Difference]: With dead ends: 52686 [2025-03-16 20:30:07,762 INFO L226 Difference]: Without dead ends: 46316 [2025-03-16 20:30:07,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:07,774 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8069 mSDsluCounter, 2367 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8069 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:07,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8069 Valid, 3998 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46316 states. [2025-03-16 20:30:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46316 to 22720. [2025-03-16 20:30:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22720 states, 22718 states have (on average 1.4576987410863633) internal successors, (33116), 22719 states have internal predecessors, (33116), 0 states have call successors, (0), 0 states 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:30:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22720 states to 22720 states and 33116 transitions. [2025-03-16 20:30:08,386 INFO L78 Accepts]: Start accepts. Automaton has 22720 states and 33116 transitions. Word has length 86 [2025-03-16 20:30:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:08,386 INFO L471 AbstractCegarLoop]: Abstraction has 22720 states and 33116 transitions. [2025-03-16 20:30:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22720 states and 33116 transitions. [2025-03-16 20:30:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:08,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:08,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:08,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:30:08,389 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:08,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash -172842997, now seen corresponding path program 1 times [2025-03-16 20:30:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:08,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173977434] [2025-03-16 20:30:08,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:08,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:08,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:08,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:08,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:30:08,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:08,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173977434] [2025-03-16 20:30:08,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173977434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:08,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:08,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:08,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910754198] [2025-03-16 20:30:08,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:08,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:08,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:08,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:08,522 INFO L87 Difference]: Start difference. First operand 22720 states and 33116 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:09,561 INFO L93 Difference]: Finished difference Result 59054 states and 86115 transitions. [2025-03-16 20:30:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:30:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:09,625 INFO L225 Difference]: With dead ends: 59054 [2025-03-16 20:30:09,625 INFO L226 Difference]: Without dead ends: 52684 [2025-03-16 20:30:09,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:09,639 INFO L435 NwaCegarLoop]: 1629 mSDtfsCounter, 8105 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8105 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:09,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8105 Valid, 3972 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52684 states. [2025-03-16 20:30:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52684 to 29088. [2025-03-16 20:30:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29088 states, 29086 states have (on average 1.4543079144605653) internal successors, (42300), 29087 states have internal predecessors, (42300), 0 states have call successors, (0), 0 states 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:30:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29088 states to 29088 states and 42300 transitions. [2025-03-16 20:30:10,315 INFO L78 Accepts]: Start accepts. Automaton has 29088 states and 42300 transitions. Word has length 86 [2025-03-16 20:30:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:10,315 INFO L471 AbstractCegarLoop]: Abstraction has 29088 states and 42300 transitions. [2025-03-16 20:30:10,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 29088 states and 42300 transitions. [2025-03-16 20:30:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:10,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:10,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:30:10,319 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:10,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash 584197643, now seen corresponding path program 1 times [2025-03-16 20:30:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256200816] [2025-03-16 20:30:10,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:10,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:10,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:10,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:10,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:30:10,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:10,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256200816] [2025-03-16 20:30:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256200816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:10,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:10,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62395368] [2025-03-16 20:30:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:10,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:10,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:10,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:10,527 INFO L87 Difference]: Start difference. First operand 29088 states and 42300 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:30:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:11,961 INFO L93 Difference]: Finished difference Result 65422 states and 95299 transitions. [2025-03-16 20:30:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:11,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 86 [2025-03-16 20:30:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:12,023 INFO L225 Difference]: With dead ends: 65422 [2025-03-16 20:30:12,024 INFO L226 Difference]: Without dead ends: 59052 [2025-03-16 20:30:12,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:12,033 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 8170 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8170 SdHoareTripleChecker+Valid, 3992 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:12,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8170 Valid, 3992 Invalid, 176 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59052 states. [2025-03-16 20:30:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59052 to 35456. [2025-03-16 20:30:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35456 states, 35454 states have (on average 1.4521351610537598) internal successors, (51484), 35455 states have internal predecessors, (51484), 0 states have call successors, (0), 0 states 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:30:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35456 states to 35456 states and 51484 transitions. [2025-03-16 20:30:12,823 INFO L78 Accepts]: Start accepts. Automaton has 35456 states and 51484 transitions. Word has length 86 [2025-03-16 20:30:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:12,823 INFO L471 AbstractCegarLoop]: Abstraction has 35456 states and 51484 transitions. [2025-03-16 20:30:12,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:30:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 35456 states and 51484 transitions. [2025-03-16 20:30:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:12,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:12,827 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:12,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:30:12,828 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:12,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 34408715, now seen corresponding path program 1 times [2025-03-16 20:30:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:12,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723459590] [2025-03-16 20:30:12,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:12,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:12,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:12,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:12,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:30:12,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:12,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723459590] [2025-03-16 20:30:12,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723459590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:12,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:12,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649637974] [2025-03-16 20:30:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:12,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:12,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:12,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:12,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:12,944 INFO L87 Difference]: Start difference. First operand 35456 states and 51484 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:30:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:13,991 INFO L93 Difference]: Finished difference Result 71790 states and 104483 transitions. [2025-03-16 20:30:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:13,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 86 [2025-03-16 20:30:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:14,067 INFO L225 Difference]: With dead ends: 71790 [2025-03-16 20:30:14,067 INFO L226 Difference]: Without dead ends: 65420 [2025-03-16 20:30:14,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:14,089 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 8094 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8094 SdHoareTripleChecker+Valid, 3996 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:14,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8094 Valid, 3996 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65420 states. [2025-03-16 20:30:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65420 to 41824. [2025-03-16 20:30:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41824 states, 41822 states have (on average 1.4506240734541629) internal successors, (60668), 41823 states have internal predecessors, (60668), 0 states have call successors, (0), 0 states 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:30:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41824 states to 41824 states and 60668 transitions. [2025-03-16 20:30:15,073 INFO L78 Accepts]: Start accepts. Automaton has 41824 states and 60668 transitions. Word has length 86 [2025-03-16 20:30:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:15,073 INFO L471 AbstractCegarLoop]: Abstraction has 41824 states and 60668 transitions. [2025-03-16 20:30:15,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:30:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 41824 states and 60668 transitions. [2025-03-16 20:30:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:15,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:15,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:15,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:30:15,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:15,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 650380043, now seen corresponding path program 1 times [2025-03-16 20:30:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:15,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867301928] [2025-03-16 20:30:15,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:15,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:15,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:15,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:15,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:30:15,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:15,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867301928] [2025-03-16 20:30:15,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867301928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:15,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:15,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:15,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430286783] [2025-03-16 20:30:15,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:15,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:15,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:15,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:15,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:15,191 INFO L87 Difference]: Start difference. First operand 41824 states and 60668 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:17,099 INFO L93 Difference]: Finished difference Result 78158 states and 113667 transitions. [2025-03-16 20:30:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:30:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:17,192 INFO L225 Difference]: With dead ends: 78158 [2025-03-16 20:30:17,192 INFO L226 Difference]: Without dead ends: 71788 [2025-03-16 20:30:17,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:17,220 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 8018 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8018 SdHoareTripleChecker+Valid, 4111 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:17,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8018 Valid, 4111 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71788 states. [2025-03-16 20:30:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71788 to 48192. [2025-03-16 20:30:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48192 states, 48190 states have (on average 1.4495123469599502) internal successors, (69852), 48191 states have internal predecessors, (69852), 0 states have call successors, (0), 0 states 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:30:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48192 states to 48192 states and 69852 transitions. [2025-03-16 20:30:18,564 INFO L78 Accepts]: Start accepts. Automaton has 48192 states and 69852 transitions. Word has length 86 [2025-03-16 20:30:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:18,565 INFO L471 AbstractCegarLoop]: Abstraction has 48192 states and 69852 transitions. [2025-03-16 20:30:18,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 48192 states and 69852 transitions. [2025-03-16 20:30:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:30:18,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:18,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:18,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:30:18,569 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1701650639, now seen corresponding path program 1 times [2025-03-16 20:30:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:18,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075522718] [2025-03-16 20:30:18,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:18,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:30:18,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:30:18,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075522718] [2025-03-16 20:30:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075522718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:18,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:18,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530225235] [2025-03-16 20:30:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:18,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:18,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:18,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:18,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:18,637 INFO L87 Difference]: Start difference. First operand 48192 states and 69852 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:19,402 INFO L93 Difference]: Finished difference Result 94084 states and 136094 transitions. [2025-03-16 20:30:19,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:19,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-16 20:30:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:19,584 INFO L225 Difference]: With dead ends: 94084 [2025-03-16 20:30:19,584 INFO L226 Difference]: Without dead ends: 48194 [2025-03-16 20:30:19,600 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:30:19,600 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 53 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:19,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48194 states. [2025-03-16 20:30:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48194 to 48192. [2025-03-16 20:30:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48192 states, 48190 states have (on average 1.4352355260427474) internal successors, (69164), 48191 states have internal predecessors, (69164), 0 states have call successors, (0), 0 states 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:30:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48192 states to 48192 states and 69164 transitions. [2025-03-16 20:30:20,717 INFO L78 Accepts]: Start accepts. Automaton has 48192 states and 69164 transitions. Word has length 87 [2025-03-16 20:30:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:20,717 INFO L471 AbstractCegarLoop]: Abstraction has 48192 states and 69164 transitions. [2025-03-16 20:30:20,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 48192 states and 69164 transitions. [2025-03-16 20:30:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:30:20,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:20,719 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:20,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:30:20,719 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:20,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1575337651, now seen corresponding path program 1 times [2025-03-16 20:30:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988510938] [2025-03-16 20:30:20,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:20,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:30:20,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:30:20,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:20,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:20,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:20,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988510938] [2025-03-16 20:30:20,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988510938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:20,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867472207] [2025-03-16 20:30:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:20,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:20,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:20,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:20,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:20,783 INFO L87 Difference]: Start difference. First operand 48192 states and 69164 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:30:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:21,210 INFO L93 Difference]: Finished difference Result 65016 states and 93427 transitions. [2025-03-16 20:30:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 20:30:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:21,238 INFO L225 Difference]: With dead ends: 65016 [2025-03-16 20:30:21,239 INFO L226 Difference]: Without dead ends: 19126 [2025-03-16 20:30:21,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:21,266 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 47 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3145 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:30:21,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3145 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19126 states. [2025-03-16 20:30:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19126 to 19119. [2025-03-16 20:30:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19119 states, 19117 states have (on average 1.4451535282732646) internal successors, (27627), 19118 states have internal predecessors, (27627), 0 states have call successors, (0), 0 states 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:30:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19119 states to 19119 states and 27627 transitions. [2025-03-16 20:30:21,644 INFO L78 Accepts]: Start accepts. Automaton has 19119 states and 27627 transitions. Word has length 88 [2025-03-16 20:30:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:21,644 INFO L471 AbstractCegarLoop]: Abstraction has 19119 states and 27627 transitions. [2025-03-16 20:30:21,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:30:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19119 states and 27627 transitions. [2025-03-16 20:30:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:30:21,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:21,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:21,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:30:21,646 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:21,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:21,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1115437610, now seen corresponding path program 1 times [2025-03-16 20:30:21,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:21,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181960816] [2025-03-16 20:30:21,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:21,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:30:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:30:21,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:21,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181960816] [2025-03-16 20:30:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181960816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:21,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:21,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115285624] [2025-03-16 20:30:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:21,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:21,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:21,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:21,712 INFO L87 Difference]: Start difference. First operand 19119 states and 27627 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:30:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:21,886 INFO L93 Difference]: Finished difference Result 27523 states and 39629 transitions. [2025-03-16 20:30:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:21,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 20:30:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:21,900 INFO L225 Difference]: With dead ends: 27523 [2025-03-16 20:30:21,900 INFO L226 Difference]: Without dead ends: 10721 [2025-03-16 20:30:21,912 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:30:21,914 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 49 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3124 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:30:21,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3124 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states. [2025-03-16 20:30:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 10719. [2025-03-16 20:30:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10719 states, 10717 states have (on average 1.4469534384622562) internal successors, (15507), 10718 states have internal predecessors, (15507), 0 states have call successors, (0), 0 states 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:30:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10719 states to 10719 states and 15507 transitions. [2025-03-16 20:30:22,130 INFO L78 Accepts]: Start accepts. Automaton has 10719 states and 15507 transitions. Word has length 89 [2025-03-16 20:30:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:22,131 INFO L471 AbstractCegarLoop]: Abstraction has 10719 states and 15507 transitions. [2025-03-16 20:30:22,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:30:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 10719 states and 15507 transitions. [2025-03-16 20:30:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:30:22,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:22,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:22,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:30:22,132 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:22,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1650890717, now seen corresponding path program 1 times [2025-03-16 20:30:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:22,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036210672] [2025-03-16 20:30:22,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:22,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:30:22,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:30:22,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:22,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:22,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:22,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036210672] [2025-03-16 20:30:22,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036210672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:22,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:22,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906113982] [2025-03-16 20:30:22,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:22,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:22,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:22,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:22,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:22,198 INFO L87 Difference]: Start difference. First operand 10719 states and 15507 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:22,298 INFO L93 Difference]: Finished difference Result 14923 states and 21449 transitions. [2025-03-16 20:30:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-16 20:30:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:22,306 INFO L225 Difference]: With dead ends: 14923 [2025-03-16 20:30:22,306 INFO L226 Difference]: Without dead ends: 6521 [2025-03-16 20:30:22,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:22,312 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 46 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3109 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:30:22,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3109 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6521 states. [2025-03-16 20:30:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6521 to 6519. [2025-03-16 20:30:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6519 states, 6517 states have (on average 1.4588000613779346) internal successors, (9507), 6518 states have internal predecessors, (9507), 0 states have call successors, (0), 0 states 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:30:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6519 states to 6519 states and 9507 transitions. [2025-03-16 20:30:22,430 INFO L78 Accepts]: Start accepts. Automaton has 6519 states and 9507 transitions. Word has length 91 [2025-03-16 20:30:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:22,430 INFO L471 AbstractCegarLoop]: Abstraction has 6519 states and 9507 transitions. [2025-03-16 20:30:22,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6519 states and 9507 transitions. [2025-03-16 20:30:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:30:22,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:22,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:22,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 20:30:22,432 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:22,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1534330596, now seen corresponding path program 1 times [2025-03-16 20:30:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:22,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555172477] [2025-03-16 20:30:22,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:22,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:30:22,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:30:22,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:22,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:22,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555172477] [2025-03-16 20:30:22,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555172477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:22,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866283378] [2025-03-16 20:30:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:22,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:22,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:22,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:22,506 INFO L87 Difference]: Start difference. First operand 6519 states and 9507 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:22,560 INFO L93 Difference]: Finished difference Result 8623 states and 12449 transitions. [2025-03-16 20:30:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 20:30:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:22,567 INFO L225 Difference]: With dead ends: 8623 [2025-03-16 20:30:22,567 INFO L226 Difference]: Without dead ends: 4421 [2025-03-16 20:30:22,570 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:30:22,571 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 43 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3094 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:30:22,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3094 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2025-03-16 20:30:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 4419. [2025-03-16 20:30:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4419 states, 4417 states have (on average 1.4799637763187683) internal successors, (6537), 4418 states have internal predecessors, (6537), 0 states have call successors, (0), 0 states 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:30:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 6537 transitions. [2025-03-16 20:30:22,633 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 6537 transitions. Word has length 93 [2025-03-16 20:30:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:22,633 INFO L471 AbstractCegarLoop]: Abstraction has 4419 states and 6537 transitions. [2025-03-16 20:30:22,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 6537 transitions. [2025-03-16 20:30:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:30:22,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:22,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:22,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:30:22,634 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:22,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:22,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1545960725, now seen corresponding path program 1 times [2025-03-16 20:30:22,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:22,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943852021] [2025-03-16 20:30:22,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:22,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:30:22,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:30:22,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:22,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943852021] [2025-03-16 20:30:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943852021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237847468] [2025-03-16 20:30:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:22,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:22,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:22,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:22,702 INFO L87 Difference]: Start difference. First operand 4419 states and 6537 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:22,735 INFO L93 Difference]: Finished difference Result 5473 states and 7994 transitions. [2025-03-16 20:30:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:22,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-16 20:30:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:22,740 INFO L225 Difference]: With dead ends: 5473 [2025-03-16 20:30:22,741 INFO L226 Difference]: Without dead ends: 3371 [2025-03-16 20:30:22,742 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:30:22,742 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 40 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3079 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:30:22,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3079 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2025-03-16 20:30:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3369. [2025-03-16 20:30:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3367 states have (on average 1.5049005049005049) internal successors, (5067), 3368 states have internal predecessors, (5067), 0 states have call successors, (0), 0 states 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:30:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 5067 transitions. [2025-03-16 20:30:22,784 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 5067 transitions. Word has length 95 [2025-03-16 20:30:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 3369 states and 5067 transitions. [2025-03-16 20:30:22,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 5067 transitions. [2025-03-16 20:30:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:30:22,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:22,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:30:22,785 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:22,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash 241665038, now seen corresponding path program 1 times [2025-03-16 20:30:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:22,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859459256] [2025-03-16 20:30:22,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:22,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:30:22,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:30:22,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:22,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:23,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:23,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859459256] [2025-03-16 20:30:23,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859459256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:30:23,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185622392] [2025-03-16 20:30:23,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:23,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:30:23,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:23,493 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:30:23,495 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:30:23,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:30:23,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:30:23,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:23,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:23,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:30:23,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:30:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:23,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:30:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185622392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:30:24,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:30:24,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:30:24,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462449999] [2025-03-16 20:30:24,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:30:24,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:30:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:24,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:30:24,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:30:24,536 INFO L87 Difference]: Start difference. First operand 3369 states and 5067 transitions. Second operand has 21 states, 21 states have (on average 13.380952380952381) internal successors, (281), 21 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:30:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:27,685 INFO L93 Difference]: Finished difference Result 10898 states and 15143 transitions. [2025-03-16 20:30:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-16 20:30:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.380952380952381) internal successors, (281), 21 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 20:30:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:27,695 INFO L225 Difference]: With dead ends: 10898 [2025-03-16 20:30:27,696 INFO L226 Difference]: Without dead ends: 9756 [2025-03-16 20:30:27,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1016, Invalid=4990, Unknown=0, NotChecked=0, Total=6006 [2025-03-16 20:30:27,700 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 14825 mSDsluCounter, 7151 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14825 SdHoareTripleChecker+Valid, 8737 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:27,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14825 Valid, 8737 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 20:30:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9756 states. [2025-03-16 20:30:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9756 to 9132. [2025-03-16 20:30:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9132 states, 9130 states have (on average 1.3855421686746987) internal successors, (12650), 9131 states have internal predecessors, (12650), 0 states have call successors, (0), 0 states 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:30:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9132 states to 9132 states and 12650 transitions. [2025-03-16 20:30:28,012 INFO L78 Accepts]: Start accepts. Automaton has 9132 states and 12650 transitions. Word has length 97 [2025-03-16 20:30:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:28,012 INFO L471 AbstractCegarLoop]: Abstraction has 9132 states and 12650 transitions. [2025-03-16 20:30:28,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.380952380952381) internal successors, (281), 21 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:30:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 9132 states and 12650 transitions. [2025-03-16 20:30:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:30:28,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:28,013 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, 1, 1, 1, 1, 1, 1, 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:30:28,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 20:30:28,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 20:30:28,214 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:28,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -86681077, now seen corresponding path program 1 times [2025-03-16 20:30:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67117089] [2025-03-16 20:30:28,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:28,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:30:28,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:30:28,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:28,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:28,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:28,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67117089] [2025-03-16 20:30:28,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67117089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:30:28,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419733585] [2025-03-16 20:30:28,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:30:28,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:28,536 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:30:28,537 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:30:28,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:30:28,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:30:28,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:28,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:28,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:30:28,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:30:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:29,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:30:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419733585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:30:29,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:30:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-16 20:30:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819586543] [2025-03-16 20:30:29,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:30:29,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 20:30:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:29,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 20:30:29,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-03-16 20:30:29,729 INFO L87 Difference]: Start difference. First operand 9132 states and 12650 transitions. Second operand has 22 states, 22 states have (on average 10.681818181818182) internal successors, (235), 21 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:30:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:30,369 INFO L93 Difference]: Finished difference Result 22366 states and 30180 transitions. [2025-03-16 20:30:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:30:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.681818181818182) internal successors, (235), 21 states have internal predecessors, (235), 0 states have call successors, (0), 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 98 [2025-03-16 20:30:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:30,385 INFO L225 Difference]: With dead ends: 22366 [2025-03-16 20:30:30,386 INFO L226 Difference]: Without dead ends: 16053 [2025-03-16 20:30:30,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 20:30:30,393 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 10713 mSDsluCounter, 4874 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10713 SdHoareTripleChecker+Valid, 6394 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:30,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10713 Valid, 6394 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:30:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16053 states. [2025-03-16 20:30:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16053 to 15877. [2025-03-16 20:30:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15875 states have (on average 1.3429921259842519) internal successors, (21320), 15876 states have internal predecessors, (21320), 0 states have call successors, (0), 0 states 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:30:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 21320 transitions. [2025-03-16 20:30:30,758 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 21320 transitions. Word has length 98 [2025-03-16 20:30:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:30,758 INFO L471 AbstractCegarLoop]: Abstraction has 15877 states and 21320 transitions. [2025-03-16 20:30:30,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.681818181818182) internal successors, (235), 21 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:30:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 21320 transitions. [2025-03-16 20:30:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:30:30,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:30,760 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, 1, 1, 1, 1, 1, 1, 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:30:30,767 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:30:30,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 20:30:30,961 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:30,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 803172619, now seen corresponding path program 1 times [2025-03-16 20:30:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929564710] [2025-03-16 20:30:30,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:30:30,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:30:30,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:30,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:31,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:31,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929564710] [2025-03-16 20:30:31,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929564710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:30:31,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143198697] [2025-03-16 20:30:31,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:31,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:30:31,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:31,289 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:30:31,290 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:30:31,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:30:31,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:30:31,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:31,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:31,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:30:31,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:30:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:31,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:30:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:32,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143198697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:30:32,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:30:32,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-16 20:30:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778982767] [2025-03-16 20:30:32,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:30:32,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 20:30:32,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:32,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 20:30:32,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:30:32,477 INFO L87 Difference]: Start difference. First operand 15877 states and 21320 transitions. Second operand has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 29 states have internal predecessors, (241), 0 states have call successors, (0), 0 states 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:30:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:33,443 INFO L93 Difference]: Finished difference Result 31993 states and 42636 transitions. [2025-03-16 20:30:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 20:30:33,444 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 29 states have internal predecessors, (241), 0 states have call successors, (0), 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 98 [2025-03-16 20:30:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:33,465 INFO L225 Difference]: With dead ends: 31993 [2025-03-16 20:30:33,466 INFO L226 Difference]: Without dead ends: 23576 [2025-03-16 20:30:33,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=1459, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 20:30:33,476 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 16767 mSDsluCounter, 5082 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16767 SdHoareTripleChecker+Valid, 6602 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:33,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16767 Valid, 6602 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:30:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23576 states. [2025-03-16 20:30:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23576 to 16197. [2025-03-16 20:30:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16197 states, 16195 states have (on average 1.3355974066069776) internal successors, (21630), 16196 states have internal predecessors, (21630), 0 states have call successors, (0), 0 states 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:30:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16197 states to 16197 states and 21630 transitions. [2025-03-16 20:30:33,874 INFO L78 Accepts]: Start accepts. Automaton has 16197 states and 21630 transitions. Word has length 98 [2025-03-16 20:30:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:33,874 INFO L471 AbstractCegarLoop]: Abstraction has 16197 states and 21630 transitions. [2025-03-16 20:30:33,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 29 states have internal predecessors, (241), 0 states have call successors, (0), 0 states 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:30:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16197 states and 21630 transitions. [2025-03-16 20:30:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:30:33,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:33,875 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, 1, 1, 1, 1, 1, 1, 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:30:33,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:30:34,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:30:34,076 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:34,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:34,076 INFO L85 PathProgramCache]: Analyzing trace with hash -132032821, now seen corresponding path program 1 times [2025-03-16 20:30:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834400653] [2025-03-16 20:30:34,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:30:34,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:30:34,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:34,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834400653] [2025-03-16 20:30:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834400653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:30:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607108331] [2025-03-16 20:30:34,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:34,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:30:34,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:34,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:30:34,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:30:34,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:30:34,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:30:34,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:34,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:34,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:30:34,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:30:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:34,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:30:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607108331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:30:35,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:30:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-16 20:30:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935240194] [2025-03-16 20:30:35,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:30:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 20:30:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:35,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 20:30:35,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-16 20:30:35,365 INFO L87 Difference]: Start difference. First operand 16197 states and 21630 transitions. Second operand has 25 states, 25 states have (on average 10.76) internal successors, (269), 24 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:30:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:37,028 INFO L93 Difference]: Finished difference Result 48190 states and 63541 transitions. [2025-03-16 20:30:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-16 20:30:37,028 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.76) internal successors, (269), 24 states have internal predecessors, (269), 0 states have call successors, (0), 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 98 [2025-03-16 20:30:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:37,062 INFO L225 Difference]: With dead ends: 48190 [2025-03-16 20:30:37,062 INFO L226 Difference]: Without dead ends: 34997 [2025-03-16 20:30:37,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=574, Invalid=2288, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 20:30:37,073 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 18815 mSDsluCounter, 6753 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18815 SdHoareTripleChecker+Valid, 8277 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:37,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18815 Valid, 8277 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:30:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34997 states. [2025-03-16 20:30:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34997 to 34601. [2025-03-16 20:30:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34601 states, 34599 states have (on average 1.3010491632706147) internal successors, (45015), 34600 states have internal predecessors, (45015), 0 states have call successors, (0), 0 states 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:30:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34601 states to 34601 states and 45015 transitions. [2025-03-16 20:30:37,958 INFO L78 Accepts]: Start accepts. Automaton has 34601 states and 45015 transitions. Word has length 98 [2025-03-16 20:30:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:37,959 INFO L471 AbstractCegarLoop]: Abstraction has 34601 states and 45015 transitions. [2025-03-16 20:30:37,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.76) internal successors, (269), 24 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:30:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 34601 states and 45015 transitions. [2025-03-16 20:30:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:30:37,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:37,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:37,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:30:38,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 20:30:38,160 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:38,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash 843213049, now seen corresponding path program 1 times [2025-03-16 20:30:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:38,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934837766] [2025-03-16 20:30:38,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:38,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:30:38,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:30:38,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:38,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934837766] [2025-03-16 20:30:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934837766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:30:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584616062] [2025-03-16 20:30:38,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:38,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:30:38,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:38,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:30:38,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:30:38,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:30:38,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:30:38,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:38,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:38,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:30:38,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:30:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:39,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:30:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584616062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:30:40,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:30:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2025-03-16 20:30:40,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555111388] [2025-03-16 20:30:40,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:30:40,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 20:30:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:40,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 20:30:40,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:30:40,419 INFO L87 Difference]: Start difference. First operand 34601 states and 45015 transitions. Second operand has 31 states, 31 states have (on average 8.193548387096774) internal successors, (254), 31 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:43,613 INFO L93 Difference]: Finished difference Result 127743 states and 165017 transitions. [2025-03-16 20:30:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 20:30:43,613 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.193548387096774) internal successors, (254), 31 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:30:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:43,703 INFO L225 Difference]: With dead ends: 127743 [2025-03-16 20:30:43,703 INFO L226 Difference]: Without dead ends: 96338 [2025-03-16 20:30:43,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=779, Invalid=2413, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 20:30:43,725 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 22149 mSDsluCounter, 5059 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22149 SdHoareTripleChecker+Valid, 6596 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:43,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22149 Valid, 6596 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:30:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96338 states. [2025-03-16 20:30:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96338 to 94072. [2025-03-16 20:30:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94072 states, 94070 states have (on average 1.2778569150632508) internal successors, (120208), 94071 states have internal predecessors, (120208), 0 states have call successors, (0), 0 states 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:30:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94072 states to 94072 states and 120208 transitions. [2025-03-16 20:30:46,540 INFO L78 Accepts]: Start accepts. Automaton has 94072 states and 120208 transitions. Word has length 100 [2025-03-16 20:30:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:46,540 INFO L471 AbstractCegarLoop]: Abstraction has 94072 states and 120208 transitions. [2025-03-16 20:30:46,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.193548387096774) internal successors, (254), 31 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 94072 states and 120208 transitions. [2025-03-16 20:30:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:30:46,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:46,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:46,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 20:30:46,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:30:46,743 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1453476711, now seen corresponding path program 1 times [2025-03-16 20:30:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403876516] [2025-03-16 20:30:46,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:46,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:30:46,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:30:46,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:46,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:46,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403876516] [2025-03-16 20:30:46,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403876516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:30:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226386904] [2025-03-16 20:30:46,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:30:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:46,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:30:46,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:30:47,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:30:47,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:30:47,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:47,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:47,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:30:47,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:30:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:47,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:30:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:48,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226386904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:30:48,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:30:48,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-03-16 20:30:48,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029828018] [2025-03-16 20:30:48,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:30:48,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:30:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:48,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:30:48,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:30:48,532 INFO L87 Difference]: Start difference. First operand 94072 states and 120208 transitions. Second operand has 32 states, 32 states have (on average 8.09375) internal successors, (259), 32 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:59,875 INFO L93 Difference]: Finished difference Result 395708 states and 502688 transitions. [2025-03-16 20:30:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-16 20:30:59,876 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.09375) internal successors, (259), 32 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 20:30:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:00,376 INFO L225 Difference]: With dead ends: 395708 [2025-03-16 20:31:00,376 INFO L226 Difference]: Without dead ends: 309759 [2025-03-16 20:31:00,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2126 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1438, Invalid=6572, Unknown=0, NotChecked=0, Total=8010 [2025-03-16 20:31:00,460 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 19082 mSDsluCounter, 13171 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19082 SdHoareTripleChecker+Valid, 14753 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:00,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19082 Valid, 14753 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 20:31:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309759 states. [2025-03-16 20:31:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309759 to 184883. [2025-03-16 20:31:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184883 states, 184881 states have (on average 1.2598536355818066) internal successors, (232923), 184882 states have internal predecessors, (232923), 0 states have call successors, (0), 0 states 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:31:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184883 states to 184883 states and 232923 transitions. [2025-03-16 20:31:07,893 INFO L78 Accepts]: Start accepts. Automaton has 184883 states and 232923 transitions. Word has length 101 [2025-03-16 20:31:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:07,893 INFO L471 AbstractCegarLoop]: Abstraction has 184883 states and 232923 transitions. [2025-03-16 20:31:07,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.09375) internal successors, (259), 32 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 184883 states and 232923 transitions. [2025-03-16 20:31:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 20:31:07,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:07,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:07,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 20:31:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:08,097 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash -719234689, now seen corresponding path program 1 times [2025-03-16 20:31:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034613802] [2025-03-16 20:31:08,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:08,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:31:08,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:31:08,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:08,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034613802] [2025-03-16 20:31:08,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034613802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674724927] [2025-03-16 20:31:08,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:08,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:08,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:31:08,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:31:08,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:31:08,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:31:08,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:08,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:08,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 20:31:08,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:10,952 INFO L312 TraceCheckSpWp]: Computing backward predicates...