./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/hardness-nfm22/hardness_operatoramount_amount500_file-72.i -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 f1d9b1e41dffeaea131d798bbdfd7596d256be5a23994dc1bad36ef03f5ad100 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:47:05,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:47:05,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:47:05,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:47:05,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:47:05,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:47:05,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:47:05,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:47:05,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:47:05,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:47:05,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:47:05,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:47:05,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:47:05,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:47:05,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:47:05,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:47:05,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:47:05,236 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:47:05,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:47:05,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:47:05,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:47:05,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:47:05,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:47:05,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:47:05,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:47:05,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:47:05,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:47:05,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:47:05,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:47:05,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:47:05,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:47:05,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:47:05,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:47:05,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:47:05,239 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 -> f1d9b1e41dffeaea131d798bbdfd7596d256be5a23994dc1bad36ef03f5ad100 [2025-03-08 15:47:05,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:47:05,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:47:05,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:47:05,499 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:47:05,499 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:47:05,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i [2025-03-08 15:47:07,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b61bac71/86eeb83f34d14596be567d595ab2aebb/FLAGf135fbaaf [2025-03-08 15:47:07,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:47:07,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i [2025-03-08 15:47:07,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b61bac71/86eeb83f34d14596be567d595ab2aebb/FLAGf135fbaaf [2025-03-08 15:47:07,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b61bac71/86eeb83f34d14596be567d595ab2aebb [2025-03-08 15:47:07,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:47:07,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:47:07,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:47:07,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:47:07,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:47:07,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:47:07" (1/1) ... [2025-03-08 15:47:07,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363b5286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:07, skipping insertion in model container [2025-03-08 15:47:07,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:47:07" (1/1) ... [2025-03-08 15:47:07,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:47:07,907 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/hardness-nfm22/hardness_operatoramount_amount500_file-72.i[916,929] [2025-03-08 15:47:08,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:47:08,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:47:08,135 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/hardness-nfm22/hardness_operatoramount_amount500_file-72.i[916,929] [2025-03-08 15:47:08,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:47:08,274 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:47:08,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08 WrapperNode [2025-03-08 15:47:08,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:47:08,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:47:08,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:47:08,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:47:08,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,368 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 633 [2025-03-08 15:47:08,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:47:08,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:47:08,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:47:08,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:47:08,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,441 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-08 15:47:08,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:47:08,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:47:08,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:47:08,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:47:08,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (1/1) ... [2025-03-08 15:47:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:47:08,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:08,559 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-08 15:47:08,565 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-08 15:47:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:47:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:47:08,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:47:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:47:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:47:08,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:47:08,680 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:47:08,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:47:09,532 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L634: havoc property_#t~ite42#1;havoc property_#t~bitwise41#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1; [2025-03-08 15:47:09,651 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-03-08 15:47:09,651 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:47:09,668 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:47:09,668 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:47:09,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:09 BoogieIcfgContainer [2025-03-08 15:47:09,669 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:47:09,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:47:09,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:47:09,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:47:09,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:47:07" (1/3) ... [2025-03-08 15:47:09,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac001ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:09, skipping insertion in model container [2025-03-08 15:47:09,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:08" (2/3) ... [2025-03-08 15:47:09,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac001ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:09, skipping insertion in model container [2025-03-08 15:47:09,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:09" (3/3) ... [2025-03-08 15:47:09,676 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-72.i [2025-03-08 15:47:09,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:47:09,691 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-72.i that has 2 procedures, 257 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:47:09,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:47:09,755 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;@4d4f94d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:47:09,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:47:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 192 states have internal predecessors, (299), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-08 15:47:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-08 15:47:09,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:09,782 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:09,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:09,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash -559834430, now seen corresponding path program 1 times [2025-03-08 15:47:09,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182950107] [2025-03-08 15:47:09,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:09,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-08 15:47:09,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-08 15:47:09,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:09,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-03-08 15:47:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182950107] [2025-03-08 15:47:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182950107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:10,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915518896] [2025-03-08 15:47:10,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:10,413 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-08 15:47:10,414 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-08 15:47:10,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-08 15:47:10,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-08 15:47:10,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:10,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:10,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:47:10,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-03-08 15:47:10,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:47:10,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915518896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:10,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:47:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:47:10,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623147883] [2025-03-08 15:47:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:10,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:47:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:10,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:47:10,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:47:10,838 INFO L87 Difference]: Start difference. First operand has 257 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 192 states have internal predecessors, (299), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-08 15:47:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:10,898 INFO L93 Difference]: Finished difference Result 508 states and 908 transitions. [2025-03-08 15:47:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:47:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) Word has length 442 [2025-03-08 15:47:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:10,907 INFO L225 Difference]: With dead ends: 508 [2025-03-08 15:47:10,907 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 15:47:10,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 443 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-08 15:47:10,913 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:10,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:47:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 15:47:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-08 15:47:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 189 states have (on average 1.5555555555555556) internal successors, (294), 189 states have internal predecessors, (294), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-08 15:47:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 420 transitions. [2025-03-08 15:47:10,972 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 420 transitions. Word has length 442 [2025-03-08 15:47:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:10,973 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 420 transitions. [2025-03-08 15:47:10,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-08 15:47:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 420 transitions. [2025-03-08 15:47:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-08 15:47:10,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:10,983 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:10,992 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-08 15:47:11,184 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,SelfDestructingSolverStorable0 [2025-03-08 15:47:11,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:11,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1122245047, now seen corresponding path program 1 times [2025-03-08 15:47:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:11,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858606739] [2025-03-08 15:47:11,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:11,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:11,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-08 15:47:11,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-08 15:47:11,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:11,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:11,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858606739] [2025-03-08 15:47:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858606739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:11,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:11,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369814801] [2025-03-08 15:47:11,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:11,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:11,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:11,624 INFO L87 Difference]: Start difference. First operand 254 states and 420 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:11,747 INFO L93 Difference]: Finished difference Result 677 states and 1121 transitions. [2025-03-08 15:47:11,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:11,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 442 [2025-03-08 15:47:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:11,756 INFO L225 Difference]: With dead ends: 677 [2025-03-08 15:47:11,756 INFO L226 Difference]: Without dead ends: 426 [2025-03-08 15:47:11,758 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-08 15:47:11,758 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 282 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:11,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 795 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-08 15:47:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2025-03-08 15:47:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 327 states have (on average 1.5749235474006116) internal successors, (515), 328 states have internal predecessors, (515), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 15:47:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 701 transitions. [2025-03-08 15:47:11,810 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 701 transitions. Word has length 442 [2025-03-08 15:47:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:11,811 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 701 transitions. [2025-03-08 15:47:11,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 701 transitions. [2025-03-08 15:47:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-08 15:47:11,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:11,816 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:47:11,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:11,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash -913546744, now seen corresponding path program 1 times [2025-03-08 15:47:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565088822] [2025-03-08 15:47:11,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:11,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:11,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-08 15:47:11,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-08 15:47:11,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:11,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565088822] [2025-03-08 15:47:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565088822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058858809] [2025-03-08 15:47:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:12,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:12,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:12,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:12,181 INFO L87 Difference]: Start difference. First operand 423 states and 701 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:12,271 INFO L93 Difference]: Finished difference Result 1257 states and 2085 transitions. [2025-03-08 15:47:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:12,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 442 [2025-03-08 15:47:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:12,278 INFO L225 Difference]: With dead ends: 1257 [2025-03-08 15:47:12,278 INFO L226 Difference]: Without dead ends: 837 [2025-03-08 15:47:12,279 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-08 15:47:12,280 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 400 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:12,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 836 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:47:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-08 15:47:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 465. [2025-03-08 15:47:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 369 states have (on average 1.5799457994579946) internal successors, (583), 370 states have internal predecessors, (583), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 15:47:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 769 transitions. [2025-03-08 15:47:12,322 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 769 transitions. Word has length 442 [2025-03-08 15:47:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:12,323 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 769 transitions. [2025-03-08 15:47:12,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 769 transitions. [2025-03-08 15:47:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-08 15:47:12,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:12,328 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:12,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:47:12,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:12,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1010808202, now seen corresponding path program 1 times [2025-03-08 15:47:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:12,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87664701] [2025-03-08 15:47:12,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:12,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-08 15:47:12,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-08 15:47:12,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:12,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87664701] [2025-03-08 15:47:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87664701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:12,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725377622] [2025-03-08 15:47:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:12,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:12,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:12,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:12,991 INFO L87 Difference]: Start difference. First operand 465 states and 769 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:13,310 INFO L93 Difference]: Finished difference Result 1342 states and 2224 transitions. [2025-03-08 15:47:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:13,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 442 [2025-03-08 15:47:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:13,318 INFO L225 Difference]: With dead ends: 1342 [2025-03-08 15:47:13,318 INFO L226 Difference]: Without dead ends: 880 [2025-03-08 15:47:13,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 15:47:13,320 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 454 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:13,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1223 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-08 15:47:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 576. [2025-03-08 15:47:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 416 states have internal predecessors, (631), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-08 15:47:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 943 transitions. [2025-03-08 15:47:13,386 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 943 transitions. Word has length 442 [2025-03-08 15:47:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:13,388 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 943 transitions. [2025-03-08 15:47:13,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 943 transitions. [2025-03-08 15:47:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:13,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:13,397 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:13,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:47:13,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash -802445610, now seen corresponding path program 1 times [2025-03-08 15:47:13,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:13,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851788590] [2025-03-08 15:47:13,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:13,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:13,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:13,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:13,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851788590] [2025-03-08 15:47:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851788590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:14,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:14,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543898777] [2025-03-08 15:47:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:14,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:14,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:14,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:14,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:14,149 INFO L87 Difference]: Start difference. First operand 576 states and 943 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:14,428 INFO L93 Difference]: Finished difference Result 1342 states and 2223 transitions. [2025-03-08 15:47:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:14,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-08 15:47:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:14,434 INFO L225 Difference]: With dead ends: 1342 [2025-03-08 15:47:14,434 INFO L226 Difference]: Without dead ends: 880 [2025-03-08 15:47:14,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 15:47:14,436 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 306 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:14,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1214 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-08 15:47:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 590. [2025-03-08 15:47:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 429 states have (on average 1.5221445221445222) internal successors, (653), 430 states have internal predecessors, (653), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-08 15:47:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 965 transitions. [2025-03-08 15:47:14,489 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 965 transitions. Word has length 443 [2025-03-08 15:47:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:14,489 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 965 transitions. [2025-03-08 15:47:14,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 965 transitions. [2025-03-08 15:47:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:14,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:14,494 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:14,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:47:14,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash -358834187, now seen corresponding path program 1 times [2025-03-08 15:47:14,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:14,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322264219] [2025-03-08 15:47:14,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:14,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:14,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:14,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322264219] [2025-03-08 15:47:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322264219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:15,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:15,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022455011] [2025-03-08 15:47:15,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:15,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:15,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:15,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:15,236 INFO L87 Difference]: Start difference. First operand 590 states and 965 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:15,623 INFO L93 Difference]: Finished difference Result 1158 states and 1890 transitions. [2025-03-08 15:47:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:15,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-08 15:47:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:15,628 INFO L225 Difference]: With dead ends: 1158 [2025-03-08 15:47:15,628 INFO L226 Difference]: Without dead ends: 696 [2025-03-08 15:47:15,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-08 15:47:15,630 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 403 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:15,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1122 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-08 15:47:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 591. [2025-03-08 15:47:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 430 states have (on average 1.5209302325581395) internal successors, (654), 431 states have internal predecessors, (654), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-08 15:47:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 966 transitions. [2025-03-08 15:47:15,686 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 966 transitions. Word has length 443 [2025-03-08 15:47:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:15,687 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 966 transitions. [2025-03-08 15:47:15,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 966 transitions. [2025-03-08 15:47:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:15,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:15,694 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:15,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:47:15,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:15,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash -327814380, now seen corresponding path program 1 times [2025-03-08 15:47:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:15,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970267199] [2025-03-08 15:47:15,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:15,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:15,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:15,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:15,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:16,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:16,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970267199] [2025-03-08 15:47:16,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970267199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:16,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576439862] [2025-03-08 15:47:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:16,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:16,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:16,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:16,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:16,376 INFO L87 Difference]: Start difference. First operand 591 states and 966 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:16,497 INFO L93 Difference]: Finished difference Result 1054 states and 1733 transitions. [2025-03-08 15:47:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-08 15:47:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:16,504 INFO L225 Difference]: With dead ends: 1054 [2025-03-08 15:47:16,505 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 15:47:16,506 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-08 15:47:16,506 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:16,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 798 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 15:47:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-08 15:47:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 430 states have (on average 1.5162790697674418) internal successors, (652), 431 states have internal predecessors, (652), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-08 15:47:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 964 transitions. [2025-03-08 15:47:16,554 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 964 transitions. Word has length 443 [2025-03-08 15:47:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:16,555 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 964 transitions. [2025-03-08 15:47:16,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 964 transitions. [2025-03-08 15:47:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:16,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:16,561 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:16,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:47:16,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:16,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1643125077, now seen corresponding path program 1 times [2025-03-08 15:47:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:16,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466074001] [2025-03-08 15:47:16,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:16,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:17,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:17,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:17,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466074001] [2025-03-08 15:47:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466074001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:17,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:17,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852533825] [2025-03-08 15:47:17,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:17,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:17,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:17,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:17,705 INFO L87 Difference]: Start difference. First operand 591 states and 964 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-08 15:47:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:18,486 INFO L93 Difference]: Finished difference Result 1980 states and 3259 transitions. [2025-03-08 15:47:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:18,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 443 [2025-03-08 15:47:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:18,506 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 15:47:18,506 INFO L226 Difference]: Without dead ends: 1517 [2025-03-08 15:47:18,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:18,513 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 1367 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:18,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 1064 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:47:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-08 15:47:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1128. [2025-03-08 15:47:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 872 states have (on average 1.5642201834862386) internal successors, (1364), 874 states have internal predecessors, (1364), 249 states have call successors, (249), 6 states have call predecessors, (249), 6 states have return successors, (249), 247 states have call predecessors, (249), 249 states have call successors, (249) [2025-03-08 15:47:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1862 transitions. [2025-03-08 15:47:18,631 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1862 transitions. Word has length 443 [2025-03-08 15:47:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:18,632 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1862 transitions. [2025-03-08 15:47:18,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-08 15:47:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1862 transitions. [2025-03-08 15:47:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:18,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:18,635 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:18,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:47:18,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:18,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:18,636 INFO L85 PathProgramCache]: Analyzing trace with hash -540551850, now seen corresponding path program 1 times [2025-03-08 15:47:18,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:18,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808488469] [2025-03-08 15:47:18,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:18,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:18,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:19,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:19,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:19,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808488469] [2025-03-08 15:47:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808488469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:19,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:19,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818259635] [2025-03-08 15:47:19,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:19,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:19,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:19,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:19,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:19,652 INFO L87 Difference]: Start difference. First operand 1128 states and 1862 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:19,909 INFO L93 Difference]: Finished difference Result 2138 states and 3532 transitions. [2025-03-08 15:47:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:19,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-08 15:47:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:19,917 INFO L225 Difference]: With dead ends: 2138 [2025-03-08 15:47:19,917 INFO L226 Difference]: Without dead ends: 1138 [2025-03-08 15:47:19,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:19,920 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 499 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:19,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1054 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-03-08 15:47:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 894. [2025-03-08 15:47:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 698 states have (on average 1.5802292263610316) internal successors, (1103), 698 states have internal predecessors, (1103), 189 states have call successors, (189), 6 states have call predecessors, (189), 6 states have return successors, (189), 189 states have call predecessors, (189), 189 states have call successors, (189) [2025-03-08 15:47:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1481 transitions. [2025-03-08 15:47:19,991 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1481 transitions. Word has length 443 [2025-03-08 15:47:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:19,992 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1481 transitions. [2025-03-08 15:47:19,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1481 transitions. [2025-03-08 15:47:19,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:19,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:19,995 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:19,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:47:19,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:19,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1579735349, now seen corresponding path program 1 times [2025-03-08 15:47:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913350652] [2025-03-08 15:47:19,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:20,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:20,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:20,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:20,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:20,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:20,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913350652] [2025-03-08 15:47:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913350652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59910342] [2025-03-08 15:47:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:20,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:20,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:20,997 INFO L87 Difference]: Start difference. First operand 894 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:21,191 INFO L93 Difference]: Finished difference Result 1946 states and 3223 transitions. [2025-03-08 15:47:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-08 15:47:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:21,199 INFO L225 Difference]: With dead ends: 1946 [2025-03-08 15:47:21,199 INFO L226 Difference]: Without dead ends: 1180 [2025-03-08 15:47:21,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 15:47:21,202 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 155 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:21,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1390 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-08 15:47:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1176. [2025-03-08 15:47:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 966 states have (on average 1.5859213250517599) internal successors, (1532), 968 states have internal predecessors, (1532), 201 states have call successors, (201), 8 states have call predecessors, (201), 8 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2025-03-08 15:47:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1934 transitions. [2025-03-08 15:47:21,284 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1934 transitions. Word has length 443 [2025-03-08 15:47:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:21,285 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1934 transitions. [2025-03-08 15:47:21,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1934 transitions. [2025-03-08 15:47:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:21,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:21,288 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:21,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:47:21,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash 231137169, now seen corresponding path program 1 times [2025-03-08 15:47:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895210842] [2025-03-08 15:47:21,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:21,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:21,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:21,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:21,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:21,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895210842] [2025-03-08 15:47:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895210842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900812064] [2025-03-08 15:47:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:21,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:21,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:21,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:21,986 INFO L87 Difference]: Start difference. First operand 1176 states and 1934 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:22,231 INFO L93 Difference]: Finished difference Result 2754 states and 4511 transitions. [2025-03-08 15:47:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:22,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-08 15:47:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:22,242 INFO L225 Difference]: With dead ends: 2754 [2025-03-08 15:47:22,243 INFO L226 Difference]: Without dead ends: 1706 [2025-03-08 15:47:22,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:22,246 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 421 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:22,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1060 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-03-08 15:47:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1176. [2025-03-08 15:47:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 966 states have (on average 1.5817805383022774) internal successors, (1528), 968 states have internal predecessors, (1528), 201 states have call successors, (201), 8 states have call predecessors, (201), 8 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2025-03-08 15:47:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1930 transitions. [2025-03-08 15:47:22,334 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1930 transitions. Word has length 443 [2025-03-08 15:47:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:22,335 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1930 transitions. [2025-03-08 15:47:22,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1930 transitions. [2025-03-08 15:47:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:22,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:22,338 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:47:22,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -347368205, now seen corresponding path program 1 times [2025-03-08 15:47:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454080529] [2025-03-08 15:47:22,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:22,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:22,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:22,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:22,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:23,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454080529] [2025-03-08 15:47:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454080529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742274889] [2025-03-08 15:47:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:23,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:23,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:23,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:23,028 INFO L87 Difference]: Start difference. First operand 1176 states and 1930 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:23,440 INFO L93 Difference]: Finished difference Result 4084 states and 6664 transitions. [2025-03-08 15:47:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-08 15:47:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:23,456 INFO L225 Difference]: With dead ends: 4084 [2025-03-08 15:47:23,457 INFO L226 Difference]: Without dead ends: 3036 [2025-03-08 15:47:23,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-08 15:47:23,461 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 1007 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:23,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 2194 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2025-03-08 15:47:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1246. [2025-03-08 15:47:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1036 states have (on average 1.5888030888030888) internal successors, (1646), 1038 states have internal predecessors, (1646), 201 states have call successors, (201), 8 states have call predecessors, (201), 8 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2025-03-08 15:47:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 2048 transitions. [2025-03-08 15:47:23,569 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 2048 transitions. Word has length 443 [2025-03-08 15:47:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:23,570 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 2048 transitions. [2025-03-08 15:47:23,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 2048 transitions. [2025-03-08 15:47:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 15:47:23,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:23,574 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:23,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:47:23,574 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash 855369461, now seen corresponding path program 1 times [2025-03-08 15:47:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:23,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687165051] [2025-03-08 15:47:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:23,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 15:47:23,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 15:47:23,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:23,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:24,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:24,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687165051] [2025-03-08 15:47:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687165051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:24,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:24,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788150733] [2025-03-08 15:47:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:24,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:24,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:24,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:24,453 INFO L87 Difference]: Start difference. First operand 1246 states and 2048 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:24,749 INFO L93 Difference]: Finished difference Result 3761 states and 6221 transitions. [2025-03-08 15:47:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:24,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-08 15:47:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:24,762 INFO L225 Difference]: With dead ends: 3761 [2025-03-08 15:47:24,762 INFO L226 Difference]: Without dead ends: 2643 [2025-03-08 15:47:24,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:24,768 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 366 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:24,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1299 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2025-03-08 15:47:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2271. [2025-03-08 15:47:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2271 states, 2061 states have (on average 1.6438622028141678) internal successors, (3388), 2063 states have internal predecessors, (3388), 201 states have call successors, (201), 8 states have call predecessors, (201), 8 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2025-03-08 15:47:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 3790 transitions. [2025-03-08 15:47:24,870 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 3790 transitions. Word has length 443 [2025-03-08 15:47:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:24,870 INFO L471 AbstractCegarLoop]: Abstraction has 2271 states and 3790 transitions. [2025-03-08 15:47:24,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 3790 transitions. [2025-03-08 15:47:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 15:47:24,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:24,874 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:47:24,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1725333635, now seen corresponding path program 1 times [2025-03-08 15:47:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258704326] [2025-03-08 15:47:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:24,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 15:47:25,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 15:47:25,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:25,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:25,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258704326] [2025-03-08 15:47:25,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258704326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:25,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:25,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171883120] [2025-03-08 15:47:25,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:25,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:25,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:25,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:25,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:25,696 INFO L87 Difference]: Start difference. First operand 2271 states and 3790 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:26,277 INFO L93 Difference]: Finished difference Result 6277 states and 10524 transitions. [2025-03-08 15:47:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:26,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 444 [2025-03-08 15:47:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:26,296 INFO L225 Difference]: With dead ends: 6277 [2025-03-08 15:47:26,296 INFO L226 Difference]: Without dead ends: 4134 [2025-03-08 15:47:26,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:26,302 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 475 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:26,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1541 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2025-03-08 15:47:26,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 4132. [2025-03-08 15:47:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 3790 states have (on average 1.6538258575197888) internal successors, (6268), 3792 states have internal predecessors, (6268), 327 states have call successors, (327), 14 states have call predecessors, (327), 14 states have return successors, (327), 325 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-08 15:47:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 6922 transitions. [2025-03-08 15:47:26,466 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 6922 transitions. Word has length 444 [2025-03-08 15:47:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:26,467 INFO L471 AbstractCegarLoop]: Abstraction has 4132 states and 6922 transitions. [2025-03-08 15:47:26,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 6922 transitions. [2025-03-08 15:47:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 15:47:26,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:26,472 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:26,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:47:26,472 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:26,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:26,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1647251649, now seen corresponding path program 1 times [2025-03-08 15:47:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:26,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801866435] [2025-03-08 15:47:26,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:26,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:26,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 15:47:28,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 15:47:28,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:28,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3 proven. 183 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-08 15:47:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801866435] [2025-03-08 15:47:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801866435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219699567] [2025-03-08 15:47:29,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:29,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:29,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:29,087 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-08 15:47:29,088 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-08 15:47:29,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 15:47:29,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 15:47:29,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:29,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:29,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 15:47:29,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 4289 proven. 216 refuted. 0 times theorem prover too weak. 3307 trivial. 0 not checked. [2025-03-08 15:47:30,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 150 proven. 219 refuted. 0 times theorem prover too weak. 7443 trivial. 0 not checked. [2025-03-08 15:47:31,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219699567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:31,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:31,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 20 [2025-03-08 15:47:31,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979001010] [2025-03-08 15:47:31,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:31,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 15:47:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:31,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 15:47:31,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:47:31,227 INFO L87 Difference]: Start difference. First operand 4132 states and 6922 transitions. Second operand has 20 states, 20 states have (on average 17.7) internal successors, (354), 20 states have internal predecessors, (354), 6 states have call successors, (163), 3 states have call predecessors, (163), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) [2025-03-08 15:47:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:33,130 INFO L93 Difference]: Finished difference Result 10642 states and 17553 transitions. [2025-03-08 15:47:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 15:47:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 17.7) internal successors, (354), 20 states have internal predecessors, (354), 6 states have call successors, (163), 3 states have call predecessors, (163), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) Word has length 444 [2025-03-08 15:47:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:33,183 INFO L225 Difference]: With dead ends: 10642 [2025-03-08 15:47:33,183 INFO L226 Difference]: Without dead ends: 6638 [2025-03-08 15:47:33,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=651, Invalid=2001, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 15:47:33,192 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 1124 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:33,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 1791 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:47:33,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-03-08 15:47:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6490. [2025-03-08 15:47:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6011 states have (on average 1.5989020129762104) internal successors, (9611), 6019 states have internal predecessors, (9611), 427 states have call successors, (427), 51 states have call predecessors, (427), 51 states have return successors, (427), 419 states have call predecessors, (427), 427 states have call successors, (427) [2025-03-08 15:47:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 10465 transitions. [2025-03-08 15:47:33,572 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 10465 transitions. Word has length 444 [2025-03-08 15:47:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:33,573 INFO L471 AbstractCegarLoop]: Abstraction has 6490 states and 10465 transitions. [2025-03-08 15:47:33,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.7) internal successors, (354), 20 states have internal predecessors, (354), 6 states have call successors, (163), 3 states have call predecessors, (163), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) [2025-03-08 15:47:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 10465 transitions. [2025-03-08 15:47:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 15:47:33,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:33,581 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:33,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:47:33,785 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,SelfDestructingSolverStorable14 [2025-03-08 15:47:33,785 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:33,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash -368444295, now seen corresponding path program 1 times [2025-03-08 15:47:33,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:33,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682768437] [2025-03-08 15:47:33,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:33,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 15:47:34,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 15:47:34,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:34,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:35,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682768437] [2025-03-08 15:47:35,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682768437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:35,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927491129] [2025-03-08 15:47:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:35,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:35,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:35,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:35,013 INFO L87 Difference]: Start difference. First operand 6490 states and 10465 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:35,529 INFO L93 Difference]: Finished difference Result 14122 states and 22674 transitions. [2025-03-08 15:47:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:47:35,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 445 [2025-03-08 15:47:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:35,558 INFO L225 Difference]: With dead ends: 14122 [2025-03-08 15:47:35,558 INFO L226 Difference]: Without dead ends: 7780 [2025-03-08 15:47:35,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:35,574 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 674 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:35,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1357 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7780 states. [2025-03-08 15:47:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7780 to 6490. [2025-03-08 15:47:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6011 states have (on average 1.5989020129762104) internal successors, (9611), 6019 states have internal predecessors, (9611), 427 states have call successors, (427), 51 states have call predecessors, (427), 51 states have return successors, (427), 419 states have call predecessors, (427), 427 states have call successors, (427) [2025-03-08 15:47:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 10465 transitions. [2025-03-08 15:47:35,833 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 10465 transitions. Word has length 445 [2025-03-08 15:47:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:35,834 INFO L471 AbstractCegarLoop]: Abstraction has 6490 states and 10465 transitions. [2025-03-08 15:47:35,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 10465 transitions. [2025-03-08 15:47:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 15:47:35,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:35,841 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:35,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:47:35,841 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:35,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash -608984424, now seen corresponding path program 1 times [2025-03-08 15:47:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143466468] [2025-03-08 15:47:35,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:35,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 15:47:36,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 15:47:36,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:36,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:37,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:37,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143466468] [2025-03-08 15:47:37,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143466468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:47:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511639931] [2025-03-08 15:47:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:37,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:47:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:37,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:47:37,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:37,178 INFO L87 Difference]: Start difference. First operand 6490 states and 10465 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:37,787 INFO L93 Difference]: Finished difference Result 24848 states and 40368 transitions. [2025-03-08 15:47:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:47:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 445 [2025-03-08 15:47:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:37,826 INFO L225 Difference]: With dead ends: 24848 [2025-03-08 15:47:37,826 INFO L226 Difference]: Without dead ends: 18506 [2025-03-08 15:47:37,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:47:37,834 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 819 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:37,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 2190 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18506 states. [2025-03-08 15:47:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18506 to 6581. [2025-03-08 15:47:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6581 states, 6102 states have (on average 1.5994755817764668) internal successors, (9760), 6110 states have internal predecessors, (9760), 427 states have call successors, (427), 51 states have call predecessors, (427), 51 states have return successors, (427), 419 states have call predecessors, (427), 427 states have call successors, (427) [2025-03-08 15:47:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 10614 transitions. [2025-03-08 15:47:38,192 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 10614 transitions. Word has length 445 [2025-03-08 15:47:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:38,193 INFO L471 AbstractCegarLoop]: Abstraction has 6581 states and 10614 transitions. [2025-03-08 15:47:38,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 10614 transitions. [2025-03-08 15:47:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 15:47:38,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:38,198 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:38,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:47:38,198 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:38,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2141911997, now seen corresponding path program 1 times [2025-03-08 15:47:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978306846] [2025-03-08 15:47:38,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:38,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 15:47:40,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 15:47:40,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:40,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 9 proven. 177 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-08 15:47:40,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:40,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978306846] [2025-03-08 15:47:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978306846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:40,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648721094] [2025-03-08 15:47:40,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:40,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:40,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:40,675 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-08 15:47:40,676 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-08 15:47:40,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 15:47:40,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 15:47:40,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:40,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:40,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:47:40,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3962 proven. 96 refuted. 0 times theorem prover too weak. 3754 trivial. 0 not checked. [2025-03-08 15:47:41,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 90 proven. 96 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-08 15:47:41,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648721094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:41,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:41,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:47:41,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595427806] [2025-03-08 15:47:41,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:41,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:47:41,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:41,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:47:41,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:47:41,609 INFO L87 Difference]: Start difference. First operand 6581 states and 10614 transitions. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 3 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) [2025-03-08 15:47:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:42,156 INFO L93 Difference]: Finished difference Result 11371 states and 18119 transitions. [2025-03-08 15:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:47:42,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 3 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) Word has length 445 [2025-03-08 15:47:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:42,170 INFO L225 Difference]: With dead ends: 11371 [2025-03-08 15:47:42,170 INFO L226 Difference]: Without dead ends: 4949 [2025-03-08 15:47:42,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 887 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:47:42,180 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 456 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:42,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 800 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2025-03-08 15:47:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4853. [2025-03-08 15:47:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 4356 states have (on average 1.5495867768595042) internal successors, (6750), 4364 states have internal predecessors, (6750), 427 states have call successors, (427), 69 states have call predecessors, (427), 69 states have return successors, (427), 419 states have call predecessors, (427), 427 states have call successors, (427) [2025-03-08 15:47:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 7604 transitions. [2025-03-08 15:47:42,434 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 7604 transitions. Word has length 445 [2025-03-08 15:47:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:42,439 INFO L471 AbstractCegarLoop]: Abstraction has 4853 states and 7604 transitions. [2025-03-08 15:47:42,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 3 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) [2025-03-08 15:47:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 7604 transitions. [2025-03-08 15:47:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 15:47:42,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:42,447 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:42,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:47:42,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 15:47:42,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:42,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:42,649 INFO L85 PathProgramCache]: Analyzing trace with hash -255456199, now seen corresponding path program 1 times [2025-03-08 15:47:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:42,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501922902] [2025-03-08 15:47:42,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:42,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:42,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 15:47:42,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 15:47:42,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:42,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:42,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501922902] [2025-03-08 15:47:42,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501922902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:42,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:42,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:42,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598700555] [2025-03-08 15:47:42,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:42,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:42,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:42,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:42,991 INFO L87 Difference]: Start difference. First operand 4853 states and 7604 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:43,523 INFO L93 Difference]: Finished difference Result 13607 states and 21241 transitions. [2025-03-08 15:47:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:43,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 445 [2025-03-08 15:47:43,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:43,545 INFO L225 Difference]: With dead ends: 13607 [2025-03-08 15:47:43,545 INFO L226 Difference]: Without dead ends: 8910 [2025-03-08 15:47:43,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-08 15:47:43,551 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 528 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:43,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1158 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8910 states. [2025-03-08 15:47:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8910 to 8618. [2025-03-08 15:47:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8618 states, 7697 states have (on average 1.5402104716123164) internal successors, (11855), 7713 states have internal predecessors, (11855), 791 states have call successors, (791), 129 states have call predecessors, (791), 129 states have return successors, (791), 775 states have call predecessors, (791), 791 states have call successors, (791) [2025-03-08 15:47:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8618 states to 8618 states and 13437 transitions. [2025-03-08 15:47:43,969 INFO L78 Accepts]: Start accepts. Automaton has 8618 states and 13437 transitions. Word has length 445 [2025-03-08 15:47:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:43,969 INFO L471 AbstractCegarLoop]: Abstraction has 8618 states and 13437 transitions. [2025-03-08 15:47:43,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 8618 states and 13437 transitions. [2025-03-08 15:47:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-08 15:47:43,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:43,972 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:43,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:47:43,973 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:43,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash 444752251, now seen corresponding path program 1 times [2025-03-08 15:47:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069026631] [2025-03-08 15:47:43,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:44,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-08 15:47:44,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-08 15:47:44,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:44,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069026631] [2025-03-08 15:47:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069026631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804515630] [2025-03-08 15:47:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:44,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:44,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:44,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:44,410 INFO L87 Difference]: Start difference. First operand 8618 states and 13437 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:44,901 INFO L93 Difference]: Finished difference Result 14148 states and 21894 transitions. [2025-03-08 15:47:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:44,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 446 [2025-03-08 15:47:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:44,922 INFO L225 Difference]: With dead ends: 14148 [2025-03-08 15:47:44,923 INFO L226 Difference]: Without dead ends: 9180 [2025-03-08 15:47:44,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:44,929 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 228 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:44,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1016 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9180 states. [2025-03-08 15:47:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9180 to 7898. [2025-03-08 15:47:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7898 states, 6977 states have (on average 1.5294539200229325) internal successors, (10671), 6993 states have internal predecessors, (10671), 791 states have call successors, (791), 129 states have call predecessors, (791), 129 states have return successors, (791), 775 states have call predecessors, (791), 791 states have call successors, (791) [2025-03-08 15:47:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 12253 transitions. [2025-03-08 15:47:45,276 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 12253 transitions. Word has length 446 [2025-03-08 15:47:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:45,276 INFO L471 AbstractCegarLoop]: Abstraction has 7898 states and 12253 transitions. [2025-03-08 15:47:45,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 12253 transitions. [2025-03-08 15:47:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-08 15:47:45,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:45,281 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:45,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 15:47:45,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:45,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1142456362, now seen corresponding path program 1 times [2025-03-08 15:47:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:45,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573817519] [2025-03-08 15:47:45,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:45,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:45,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 15:47:45,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 15:47:45,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:45,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:46,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:46,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573817519] [2025-03-08 15:47:46,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573817519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:46,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:46,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:47:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546239155] [2025-03-08 15:47:46,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:46,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:47:46,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:46,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:47:46,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:46,047 INFO L87 Difference]: Start difference. First operand 7898 states and 12253 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:46,587 INFO L93 Difference]: Finished difference Result 19140 states and 29948 transitions. [2025-03-08 15:47:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:47:46,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 447 [2025-03-08 15:47:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:46,609 INFO L225 Difference]: With dead ends: 19140 [2025-03-08 15:47:46,609 INFO L226 Difference]: Without dead ends: 11398 [2025-03-08 15:47:46,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:46,621 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 594 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:46,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1098 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11398 states. [2025-03-08 15:47:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11398 to 7898. [2025-03-08 15:47:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7898 states, 6977 states have (on average 1.520854235344704) internal successors, (10611), 6993 states have internal predecessors, (10611), 791 states have call successors, (791), 129 states have call predecessors, (791), 129 states have return successors, (791), 775 states have call predecessors, (791), 791 states have call successors, (791) [2025-03-08 15:47:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 12193 transitions. [2025-03-08 15:47:47,004 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 12193 transitions. Word has length 447 [2025-03-08 15:47:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:47,005 INFO L471 AbstractCegarLoop]: Abstraction has 7898 states and 12193 transitions. [2025-03-08 15:47:47,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 12193 transitions. [2025-03-08 15:47:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-08 15:47:47,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:47,008 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:47,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 15:47:47,009 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:47,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1883486949, now seen corresponding path program 1 times [2025-03-08 15:47:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:47,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054515837] [2025-03-08 15:47:47,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:47,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 15:47:52,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 15:47:52,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:52,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 21 proven. 165 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-08 15:47:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054515837] [2025-03-08 15:47:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054515837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874911520] [2025-03-08 15:47:53,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:53,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:53,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:53,084 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-08 15:47:53,085 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-08 15:47:53,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 15:47:53,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 15:47:53,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:53,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:53,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:47:53,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 1616 proven. 165 refuted. 0 times theorem prover too weak. 6031 trivial. 0 not checked. [2025-03-08 15:47:53,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 21 proven. 165 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-08 15:47:54,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874911520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:54,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:54,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 15:47:54,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450925434] [2025-03-08 15:47:54,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:54,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:47:54,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:54,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:47:54,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:54,230 INFO L87 Difference]: Start difference. First operand 7898 states and 12193 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) [2025-03-08 15:47:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:54,640 INFO L93 Difference]: Finished difference Result 11811 states and 18295 transitions. [2025-03-08 15:47:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:47:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) Word has length 447 [2025-03-08 15:47:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:54,653 INFO L225 Difference]: With dead ends: 11811 [2025-03-08 15:47:54,653 INFO L226 Difference]: Without dead ends: 3401 [2025-03-08 15:47:54,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 891 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:47:54,663 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 344 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:54,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 810 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2025-03-08 15:47:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3080. [2025-03-08 15:47:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3080 states, 2614 states have (on average 1.464804896710023) internal successors, (3829), 2618 states have internal predecessors, (3829), 403 states have call successors, (403), 62 states have call predecessors, (403), 62 states have return successors, (403), 399 states have call predecessors, (403), 403 states have call successors, (403) [2025-03-08 15:47:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4635 transitions. [2025-03-08 15:47:54,847 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4635 transitions. Word has length 447 [2025-03-08 15:47:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:54,847 INFO L471 AbstractCegarLoop]: Abstraction has 3080 states and 4635 transitions. [2025-03-08 15:47:54,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) [2025-03-08 15:47:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4635 transitions. [2025-03-08 15:47:54,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-08 15:47:54,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:54,850 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:54,859 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-08 15:47:55,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:55,051 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:55,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1420722819, now seen corresponding path program 1 times [2025-03-08 15:47:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:55,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204192627] [2025-03-08 15:47:55,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:55,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 15:47:55,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 15:47:55,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:55,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:47:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204192627] [2025-03-08 15:47:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204192627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497041540] [2025-03-08 15:47:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:55,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:55,610 INFO L87 Difference]: Start difference. First operand 3080 states and 4635 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:55,797 INFO L93 Difference]: Finished difference Result 7016 states and 10595 transitions. [2025-03-08 15:47:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:55,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 447 [2025-03-08 15:47:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:55,806 INFO L225 Difference]: With dead ends: 7016 [2025-03-08 15:47:55,806 INFO L226 Difference]: Without dead ends: 2957 [2025-03-08 15:47:55,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:55,811 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 225 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:55,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 962 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2025-03-08 15:47:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2957. [2025-03-08 15:47:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 2483 states have (on average 1.4349577124446233) internal successors, (3563), 2487 states have internal predecessors, (3563), 403 states have call successors, (403), 70 states have call predecessors, (403), 70 states have return successors, (403), 399 states have call predecessors, (403), 403 states have call successors, (403) [2025-03-08 15:47:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 4369 transitions. [2025-03-08 15:47:55,966 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 4369 transitions. Word has length 447 [2025-03-08 15:47:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:55,966 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 4369 transitions. [2025-03-08 15:47:55,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:47:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 4369 transitions. [2025-03-08 15:47:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-08 15:47:55,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:55,969 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:47:55,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 15:47:55,969 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:55,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:55,969 INFO L85 PathProgramCache]: Analyzing trace with hash -939392123, now seen corresponding path program 1 times [2025-03-08 15:47:55,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:55,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069754611] [2025-03-08 15:47:55,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:55,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:55,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 15:47:57,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 15:47:57,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:57,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-08 15:47:57,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069754611] [2025-03-08 15:47:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069754611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:57,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877415361] [2025-03-08 15:47:57,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:57,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:57,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:57,721 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-08 15:47:57,722 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-08 15:47:57,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 15:47:57,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 15:47:57,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:57,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:57,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 15:47:58,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5532 proven. 102 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 15:47:58,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-08 15:47:59,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877415361] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:59,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:59,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-03-08 15:47:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469212862] [2025-03-08 15:47:59,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:59,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 15:47:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:59,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 15:47:59,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-03-08 15:47:59,352 INFO L87 Difference]: Start difference. First operand 2957 states and 4369 transitions. Second operand has 23 states, 23 states have (on average 15.0) internal successors, (345), 23 states have internal predecessors, (345), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) [2025-03-08 15:48:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:00,599 INFO L93 Difference]: Finished difference Result 6886 states and 10063 transitions. [2025-03-08 15:48:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 15:48:00,599 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 15.0) internal successors, (345), 23 states have internal predecessors, (345), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) Word has length 447 [2025-03-08 15:48:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:00,609 INFO L225 Difference]: With dead ends: 6886 [2025-03-08 15:48:00,610 INFO L226 Difference]: Without dead ends: 4089 [2025-03-08 15:48:00,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 15:48:00,614 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1966 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:00,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 1640 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:48:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2025-03-08 15:48:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 2605. [2025-03-08 15:48:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2230 states have (on average 1.4556053811659193) internal successors, (3246), 2230 states have internal predecessors, (3246), 315 states have call successors, (315), 59 states have call predecessors, (315), 59 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-08 15:48:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3876 transitions. [2025-03-08 15:48:00,748 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3876 transitions. Word has length 447 [2025-03-08 15:48:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:00,749 INFO L471 AbstractCegarLoop]: Abstraction has 2605 states and 3876 transitions. [2025-03-08 15:48:00,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.0) internal successors, (345), 23 states have internal predecessors, (345), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) [2025-03-08 15:48:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3876 transitions. [2025-03-08 15:48:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-08 15:48:00,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:00,752 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:48:00,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 15:48:00,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 15:48:00,953 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:00,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash -170222108, now seen corresponding path program 1 times [2025-03-08 15:48:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:00,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217575508] [2025-03-08 15:48:00,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:00,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 15:48:02,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 15:48:02,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:02,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 150 proven. 216 refuted. 0 times theorem prover too weak. 7446 trivial. 0 not checked. [2025-03-08 15:48:03,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217575508] [2025-03-08 15:48:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217575508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372790191] [2025-03-08 15:48:03,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:03,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:03,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:03,330 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-08 15:48:03,331 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-08 15:48:03,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 15:48:03,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 15:48:03,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:03,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:03,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 15:48:03,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5628 proven. 102 refuted. 0 times theorem prover too weak. 2082 trivial. 0 not checked. [2025-03-08 15:48:04,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:48:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-08 15:48:04,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372790191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:48:04,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:48:04,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2025-03-08 15:48:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428553344] [2025-03-08 15:48:04,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:48:04,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 15:48:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:04,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 15:48:04,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-08 15:48:04,986 INFO L87 Difference]: Start difference. First operand 2605 states and 3876 transitions. Second operand has 24 states, 24 states have (on average 14.541666666666666) internal successors, (349), 24 states have internal predecessors, (349), 10 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 10 states have call predecessors, (145), 10 states have call successors, (145) [2025-03-08 15:48:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:06,493 INFO L93 Difference]: Finished difference Result 6122 states and 9014 transitions. [2025-03-08 15:48:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 15:48:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.541666666666666) internal successors, (349), 24 states have internal predecessors, (349), 10 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 10 states have call predecessors, (145), 10 states have call successors, (145) Word has length 447 [2025-03-08 15:48:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:06,505 INFO L225 Difference]: With dead ends: 6122 [2025-03-08 15:48:06,505 INFO L226 Difference]: Without dead ends: 3681 [2025-03-08 15:48:06,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 885 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=458, Invalid=1434, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 15:48:06,510 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2043 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 829 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 829 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:06,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 1903 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [829 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:48:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2025-03-08 15:48:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 2034. [2025-03-08 15:48:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1654 states have (on average 1.4165659008464329) internal successors, (2343), 1654 states have internal predecessors, (2343), 315 states have call successors, (315), 64 states have call predecessors, (315), 64 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-08 15:48:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2973 transitions. [2025-03-08 15:48:06,657 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2973 transitions. Word has length 447 [2025-03-08 15:48:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:06,658 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2973 transitions. [2025-03-08 15:48:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.541666666666666) internal successors, (349), 24 states have internal predecessors, (349), 10 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 10 states have call predecessors, (145), 10 states have call successors, (145) [2025-03-08 15:48:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2973 transitions. [2025-03-08 15:48:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 15:48:06,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:06,660 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:48:06,671 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-08 15:48:06,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:06,861 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1556160548, now seen corresponding path program 1 times [2025-03-08 15:48:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191987273] [2025-03-08 15:48:06,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:06,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 15:48:07,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 15:48:07,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:07,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-08 15:48:07,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191987273] [2025-03-08 15:48:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191987273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:07,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:07,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:48:07,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343691506] [2025-03-08 15:48:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:07,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:48:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:07,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:48:07,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:07,588 INFO L87 Difference]: Start difference. First operand 2034 states and 2973 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:48:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:07,846 INFO L93 Difference]: Finished difference Result 4563 states and 6725 transitions. [2025-03-08 15:48:07,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:48:07,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 448 [2025-03-08 15:48:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:07,854 INFO L225 Difference]: With dead ends: 4563 [2025-03-08 15:48:07,854 INFO L226 Difference]: Without dead ends: 2697 [2025-03-08 15:48:07,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:48:07,856 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 261 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:07,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1161 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-03-08 15:48:07,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2034. [2025-03-08 15:48:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1654 states have (on average 1.407496977025393) internal successors, (2328), 1654 states have internal predecessors, (2328), 315 states have call successors, (315), 64 states have call predecessors, (315), 64 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-08 15:48:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2958 transitions. [2025-03-08 15:48:07,981 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2958 transitions. Word has length 448 [2025-03-08 15:48:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:07,982 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2958 transitions. [2025-03-08 15:48:07,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-08 15:48:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2958 transitions. [2025-03-08 15:48:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 15:48:07,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:07,984 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:48:07,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 15:48:07,984 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:07,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1994170051, now seen corresponding path program 1 times [2025-03-08 15:48:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903087195] [2025-03-08 15:48:07,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:08,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 15:48:09,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 15:48:09,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:09,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 261 proven. 279 refuted. 0 times theorem prover too weak. 7272 trivial. 0 not checked. [2025-03-08 15:48:15,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:15,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903087195] [2025-03-08 15:48:15,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903087195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:15,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406460527] [2025-03-08 15:48:15,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:15,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:15,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:15,212 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-08 15:48:15,212 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-08 15:48:15,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 15:48:15,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 15:48:15,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:15,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:15,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 15:48:15,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 4860 proven. 180 refuted. 0 times theorem prover too weak. 2772 trivial. 0 not checked. [2025-03-08 15:48:16,314 INFO L312 TraceCheckSpWp]: Computing backward predicates...